Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.extremalNumber_congr_right

∀ {n : ℕ} {W₁ : Type u_4} {W₂ : Type u_5} {H₁ : SimpleGraph W₁} {H₂ : SimpleGraph W₂} (e : H₁ ≃g H₂),
  SimpleGraph.extremalNumber n H₁ = SimpleGraph.extremalNumber n H₂

If H₁ ≃g H₂, then extremalNumber n H₁ equals extremalNumber n H₂.

Defined in
Mathlib.Combinatorics.SimpleGraph.Extremal.Basic
Cited by
0 results in Mathlib
Foundations
Depth 78 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 · cited by 3072SimpleGraphSimpleGraph.Iso · cited by 99SimpleGraph.IsoSimpleGraph.extremalNumber · cited by 23SimpleGraph.extremalNumberSimpleGraph.extremalNumber_congr · cited by 1SimpleGraph.extremalNumbe…SimpleGraph.extremalNumber_co…CITED BYCITES

Cites4

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

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.