SimpleGraph.topEmbeddingOfNotCliqueFree

{α : Type u_1} → {G : SimpleGraph α} → {n : ℕ} → ¬G.CliqueFree n → SimpleGraph.completeGraph (Fin n) ↪g G

An embedding of a complete graph that witnesses the fact that the graph is not clique-free.

Defined in: Mathlib.Combinatorics.SimpleGraph.Clique
Cited by: 2 results in Mathlib
Foundations: Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound

Around this declaration

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

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

Results whose statement or proof uses this declaration.