Theorems · Theorem · combinatorics
SimpleGraph.cliqueSet_mono
∀ {α : Type u_1} {G H : SimpleGraph α} {n : ℕ}, G ≤ H → G.cliqueSet n ⊆ H.cliqueSet n- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 58 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.
- Setstatement · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.cliqueSetstatement · cited by 18
- SimpleGraph.IsNClique.monoproof · cited by 4
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.cliqueSet_mono'proof · cited by 0
- SimpleGraph.EdgeDisjointTriangles.monoproof · cited by 0