Theorems · Theorem · combinatorics
SimpleGraph.pathGraph_preconnected
∀ (n : ℕ), (SimpleGraph.pathGraph n).Preconnected
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Hasse
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraph.Preconnectedstatement · cited by 49
- SimpleGraph.pathGraphstatement · cited by 8
- SimpleGraph.hasse_preconnected_of_succproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.pathGraph_connectedproof · cited by 1
- SimpleGraph.cycleGraph_preconnectedproof · cited by 0