Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsClique.subset

∀ {α : Type u_1} {G : SimpleGraph α} {s t : Set α}, t ⊆ s → G.IsClique s → G.IsClique t
Defined in
Mathlib.Combinatorics.SimpleGraph.Clique
Cited by
4 results in Mathlib
Foundations
Depth 7 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

SimpleGraph.CliqueFree.mono · cited by 4CliqueFree.monoSimpleGraph.Subgraph.IsPerfectMatching.exists_of_isClique_supp · cited by 1IsPerfectMatching.exists_…SimpleGraph.IsNClique.erase_of_mem · cited by 1IsNClique.erase_of_memSimpleGraph.CliqueFreeOn.mono · cited by 0CliqueFreeOn.monoSet · cited by 53352SetSimpleGraph · cited by 3072SimpleGraphSimpleGraph.IsClique · cited by 76SimpleGraph.IsCliqueSet.Pairwise.mono · cited by 55Pairwise.monoIsClique.subsetCITED BYCITES

Cites4

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by4

Results whose statement or proof uses this declaration.