Theorems · Theorem · combinatorics
SimpleGraph.pathGraph_connected
∀ (n : ℕ), (SimpleGraph.pathGraph (n + 1)).Connected
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Hasse
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 63 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.Connectedstatement · cited by 75
- SimpleGraph.pathGraphstatement · cited by 8
- SimpleGraph.pathGraph_preconnectedproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.cycleGraph_connectedproof · cited by 0