Theorems · Theorem · combinatorics
SimpleGraph.IsNClique.mono
∀ {α : Type u_1} {G H : SimpleGraph α} {n : ℕ} {s : Finset α}, G ≤ H → G.IsNClique n s → H.IsNClique n s- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
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
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.IsNCliquestatement · cited by 64
- SimpleGraph.IsClique.monoproof · cited by 2
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.cliqueSet_monoproof · cited by 2
- SimpleGraph.cliqueFinset_monoproof · cited by 0
- SimpleGraph.CliqueFreeOn.antiproof · cited by 0
- SimpleGraph.CliqueFree.antiproof · cited by 0