Theorems · Theorem · combinatorics
SimpleGraph.IsAcyclic.cliqueFree
∀ {V : Type u_1} {G : SimpleGraph V}, G.IsAcyclic → ∀ {n : ℕ}, 3 ≤ n → G.CliqueFree n- Cited by
- 0 results in Mathlib
- Foundations
- Depth 77 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
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
- le_topproof · cited by 411
- SimpleGraph.CliqueFreestatement · cited by 70
- SimpleGraph.IsContainedproof · cited by 68
- SimpleGraph.IsAcyclicstatement and proof · cited by 67
- SimpleGraph.completeGraphproof · cited by 49
- Iff.not_rightproof · cited by 20
- SimpleGraph.not_cliqueFree_iff_top_isContainedproof · cited by 7
- SimpleGraph.IsContained.of_leproof · cited by 6
- SimpleGraph.IsContained.trans'proof · cited by 5
- SimpleGraph.isAcyclic_iff_free_cycleGraphproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.