Theorems · Theorem · combinatorics
SimpleGraph.IsNClique.isClique
∀ {α : Type u_1} {G : SimpleGraph α} {n : ℕ} {s : Finset α}, G.IsNClique n s → G.IsClique ↑s- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 14 results in Mathlib
- Foundations
- Depth 54 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- SetLike.coestatement · cited by 8,199
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.IsCliquestatement · cited by 76
- SimpleGraph.IsNCliquestatement and proof · cited by 64
Cited by14
Results whose statement or proof uses this declaration.
- SimpleGraph.isNClique_iffproof · cited by 5
- SimpleGraph.CliqueFree.monoproof · cited by 4
- SimpleGraph.IsNClique.insertproof · cited by 3
- SimpleGraph.IsNClique.erase_of_sup_edge_of_memproof · cited by 2
- SimpleGraph.IsNClique.mapproof · cited by 2
- SimpleGraph.CliqueFree.mem_of_sup_edge_isNCliqueproof · cited by 2
- SimpleGraph.IsFiveWheelLike.fst_notMem_rightproof · cited by 1
- SimpleGraph.IsNClique.erase_of_memproof · cited by 1
- SimpleGraph.IsFiveWheelLike.not_colorable_succproof · cited by 1
- SimpleGraph.isNClique_map_iffproof · cited by 1
- SimpleGraph.cliqueNum_le_chromaticNumberproof · cited by 0