Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsNClique.exists_not_adj_of_cliqueFree_succ

∀ {α : Type u_1} {G : SimpleGraph α} {n : ℕ} {s : Finset α},
  G.IsNClique n s → G.CliqueFree (n + 1) → ∀ (x : α), ∃ y ∈ s, ¬G.Adj x y
Defined in
Mathlib.Combinatorics.SimpleGraph.Clique
Cited by
1 results in Mathlib
Foundations
Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.IsFiveWheelLike.minDegree_le_of_cliqueFree_fiveWheelLikeFree_succ · cited by 1IsFiveWheelLike.minDegree…Finset · cited by 13712FinsetSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.CliqueFree · cited by 70SimpleGraph.CliqueFreeSimpleGraph.IsNClique · cited by 64SimpleGraph.IsNCliqueSimpleGraph.IsNClique.not_cliqueFree · cited by 4IsNClique.not_cliqueFreeSimpleGraph.IsNClique.insert · cited by 3IsNClique.insertIsNClique.exists_not_adj_of_c…CITED BYCITES

Cites7

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

Cited by1

Results whose statement or proof uses this declaration.