Theorems · Theorem · combinatorics
SimpleGraph.IsContained.extremalNumber_le
∀ {n : ℕ} {W : Type u_2} {H : SimpleGraph W} {W' : Type u_4} {H' : SimpleGraph W'},
H'.IsContained H → SimpleGraph.extremalNumber n H' ≤ SimpleGraph.extremalNumber n HIf H contains a copy of H', then extremalNumber n H is at most extremalNumber n H.
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 78 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- Finset.cardproof · cited by 2,327
- Fintype.cardproof · cited by 1,386
- SimpleGraph.Adjproof · cited by 1,346
- Fintype.card_finproof · cited by 270
- SimpleGraph.edgeFinsetproof · cited by 116
- SimpleGraph.IsContainedstatement and proof · cited by 68
- SimpleGraph.Freeproof · cited by 39
- SimpleGraph.extremalNumberstatement and proof · cited by 23
- SimpleGraph.IsContained.transproof · cited by 9
- SimpleGraph.extremalNumber_le_iffproof · cited by 4
- SimpleGraph.IsContained.of_extremalNumber_lt_card_edgeFinsetproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.