Theorems · Inductive type · combinatorics
SimpleGraph.IsTree
{V : Type u_1} → SimpleGraph V → PropA tree is a connected acyclic graph.
- Cited by
- 32 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement · cited by 3,072
Cited by36
Results whose statement or proof uses this declaration.
- SimpleGraph.IsTree.connectedstatement and proof · cited by 9
- SimpleGraph.IsTree.isAcyclicstatement and proof · cited by 5
- SimpleGraph.IsTree.card_edgeFinsetstatement and proof · cited by 3
- SimpleGraph.Connected.exists_isTree_lestatement · cited by 2
- SimpleGraph.isTree_iffstatement and proof · cited by 1
- SimpleGraph.isTree_iff_existsUnique_pathstatement · cited by 1
- SimpleGraph.isTree_of_minimal_connectedstatement · cited by 1
- SimpleGraph.IsTree.casesOnstatement and proof · cited by 1
- SimpleGraph.IsTree.colorable_twostatement and proof · cited by 1
- SimpleGraph.IsTree.coloringTwostatement and proof · cited by 1
- SimpleGraph.IsTree.existsUnique_pathstatement and proof · cited by 1
- SimpleGraph.IsTree.exists_vert_degree_one_of_nontrivialstatement and proof · cited by 1