FormalConjectures/WrittenOnTheWallII/GraphConjecture144.lean

GitHub source file

3 declarations, 1 contain sorry, 0 declared as axioms

Written on the Wall II - Conjecture 144

Reference:E. DeLaVina, Written on the Wall II, Conjectures of Graffiti.pc

Imports (1)
  1. theorem WrittenOnTheWallII.GraphConjecture144.conjecture144 sorry line 70 source

    depends on sorry what this means

    Statement uses: Fintype, DecidableEq, Nontrivial, SimpleGraph, SimpleGraph.Connected, LE.le, Real, HAdd.hAdd, HSub.hSub, SimpleGraph.girth, OfNat.ofNat, SimpleGraph.ecc, SimpleGraph.center, SimpleGraph.largestInducedTreeSize

    Proof uses: sorryAx, Lean.Name, Bool.false, Lean.Name.num, Lean.Name.str, Lean.Name.anonymous, Nat

    19 instances, coercions and auxiliary constants left out.

    Tactic trace: 1 steps

    Open to load the checked before-and-after goal states.

  2. example WrittenOnTheWallII.GraphConjecture144.(example at line 78) line 78 source

    Source documentation

    The largestInducedTreeSize is nonneg.

    example (G : SimpleGraph (Fin 3)) : 0 ≤ largestInducedTreeSize G := Nat.zero_le _
…
  3. example WrittenOnTheWallII.GraphConjecture144.(example at line 82) line 82 source

    Source documentation

    The girth of any graph is nonneg.

    example (G : SimpleGraph (Fin 3)) : 0 ≤ G.girth := Nat.zero_le _
…