Theorems · Theorem · combinatorics
SimpleGraph.cliqueFree_bot
∀ {α : Type u_1} {n : ℕ}, 2 ≤ n → ⊥.CliqueFree n- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetproof · cited by 13,712
- Bot.botstatement and proof · cited by 4,720
- SimpleGraphstatement · cited by 3,072
- le_transproof · cited by 985
- SimpleGraph.CliqueFreestatement · cited by 70
- SimpleGraph.IsNCliqueproof · cited by 64
- SimpleGraph.isNClique_bot_iffproof · cited by 1
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.exists_isTuranMaximalproof · cited by 2
- SimpleGraph.cliqueSet_botproof · cited by 1
- SimpleGraph.cliqueFree_twoproof · cited by 0