Theorems · Theorem · combinatorics
SimpleGraph.cliqueFinset_mono
∀ {α : Type u_1} {G : SimpleGraph α} (H : SimpleGraph α) [inst : Fintype α] [inst_1 : DecidableEq α]
[inst_2 : DecidableRel G.Adj] {n : ℕ} [inst_3 : DecidableRel H.Adj], G ≤ H → G.cliqueFinset n ⊆ H.cliqueFinset n- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
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
- Fintypestatement and proof · cited by 7,736
- Finset.univproof · cited by 3,473
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- SimpleGraph.cliqueFinsetstatement · cited by 26
- Finset.monotone_filter_rightproof · cited by 10
- SimpleGraph.IsNClique.monoproof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.