Theorems · Definition · combinatorics
SimpleGraph.CliqueFree
{α : Type u_1} → SimpleGraph α → ℕ → PropG.CliqueFree n means that G has no n-cliques.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 70 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetproof · cited by 13,712
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.IsNCliqueproof · cited by 64
Cited by73
Results whose statement or proof uses this declaration.
- SimpleGraph.IsTuranMaximalproof · cited by 19
- SimpleGraph.FarFromTriangleFreeproof · cited by 15
- SimpleGraph.not_cliqueFree_iff_top_isContainedstatement and proof · cited by 7
- SimpleGraph.IsNClique.not_cliqueFreestatement and proof · cited by 4
- SimpleGraph.CliqueFree.monostatement and proof · cited by 4
- SimpleGraph.cliqueFree_iffstatement and proof · cited by 4
- SimpleGraph.completeMultipartiteGraph.not_cliqueFree_of_le_cardstatement and proof · cited by 3
- SimpleGraph.isTuranMaximal_of_isoproof · cited by 3
- SimpleGraph.CliqueFree.replaceVertexstatement and proof · cited by 3
- SimpleGraph.IsContained.not_cliqueFreestatement and proof · cited by 3
- SimpleGraph.farFromTriangleFree_iffstatement · cited by 3
- SimpleGraph.cliqueFinset_eq_empty_iffstatement · cited by 3