Theorems · Theorem · combinatorics
SimpleGraph.extremalNumber_of_fintypeCard_eq
∀ {n : ℕ} {V : Type u_1} {W : Type u_2} {H : SimpleGraph W} [inst : Fintype V],
Fintype.card V = n → SimpleGraph.extremalNumber n H = {G | H.Free G}.sup fun x => x.edgeFinset.card- Cited by
- 3 results in Mathlib
- Foundations
- Depth 75 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Fintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites32
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Finsetproof · cited by 13,712
- Equivproof · cited by 8,337
- Fintypestatement and proof · cited by 7,736
- Set.Elemproof · cited by 7,166
- Equiv.symmproof · cited by 3,681
- Finset.univstatement and proof · cited by 3,473
- SimpleGraphstatement and proof · cited by 3,072
- Finset.cardstatement and proof · cited by 2,327
- Fintype.cardstatement and proof · cited by 1,386
- SimpleGraph.Adjstatement · cited by 1,346
- Finset.filterstatement and proof · cited by 949
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.card_edgeFinset_le_extremalNumberproof · cited by 6
- SimpleGraph.extremalNumber_le_iffproof · cited by 4
- SimpleGraph.lt_extremalNumber_iffproof · cited by 1