Theorems · Theorem · combinatorics
SimpleGraph.exists_isNClique_cliqueNum
∀ {α : Type u_3} {G : SimpleGraph α}, ∃ s, G.IsNClique G.cliqueNum s- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 76 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
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
- Set.ofPredproof · cited by 6,101
- SimpleGraphstatement and proof · cited by 3,072
- BddAboveproof · cited by 620
- SimpleGraph.IsNCliquestatement and proof · cited by 64
- csSup_emptyproof · cited by 28
- csSup_of_not_bddAboveproof · cited by 16
- SimpleGraph.cliqueNumstatement · cited by 8
- Nat.sSup_memproof · cited by 5
Cited by5
Results whose statement or proof uses this declaration.
- SimpleGraph.maximumClique_card_eq_cliqueNumproof · cited by 1
- SimpleGraph.cliqueNum_induce_leproof · cited by 0
- SimpleGraph.cliqueNum_le_chromaticNumberproof · cited by 0
- SimpleGraph.maximumClique_existsproof · cited by 0
- SimpleGraph.exists_isNIndepSet_indepNumproof · cited by 0