Theorems · Theorem · combinatorics
SimpleGraph.isTree_iff_minimal_connected
∀ {V : Type u_1} {G : SimpleGraph V}, G.IsTree ↔ Minimal SimpleGraph.Connected G- Cited by
- 0 results in Mathlib
- Foundations
- Depth 86 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites20
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjproof · cited by 1,346
- SimpleGraph.Walkproof · cited by 915
- Sym2.mkproof · cited by 332
- Minimalstatement · cited by 150
- SimpleGraph.Walk.edgesproof · cited by 145
- SimpleGraph.Walk.IsPathproof · cited by 140
- SimpleGraph.Connectedstatement and proof · cited by 75
- SimpleGraph.IsTreestatement and proof · cited by 32
- SimpleGraph.Hom.ofLEproof · cited by 27
- SimpleGraph.Walk.mapLeproof · cited by 26
- SimpleGraph.IsTree.connectedproof · cited by 9
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.