Theorems · Theorem · combinatorics
SimpleGraph.IsAcyclic.of_card_le_two
∀ {V : Type u_1} {G : SimpleGraph V}, ENat.card V ≤ 2 → G.IsAcyclic- Cited by
- 1 results in Mathlib
- Foundations
- Depth 95 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- ENatstatement · cited by 4,985
- LE.le.transproof · cited by 3,151
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Walkproof · cited by 915
- SimpleGraph.Walk.supportproof · cited by 307
- SimpleGraph.Walk.lengthproof · cited by 212
- Nat.cast_leproof · cited by 159
- SimpleGraph.Walk.IsCycleproof · cited by 91
- ENat.cardstatement and proof · cited by 89
- SimpleGraph.IsAcyclicstatement · cited by 67
- SimpleGraph.Walk.length_supportproof · cited by 15
- SimpleGraph.Walk.IsCycle.isCircuitproof · cited by 14
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.IsAcyclic.of_subsingletonproof · cited by 2