Theorems · Theorem · combinatorics
SimpleGraph.card_edgeFinset_of_isExtremal_free
∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} [inst : Fintype V]
[inst_1 : DecidableRel G.Adj], G.IsExtremal H.Free → G.edgeFinset.card = SimpleGraph.extremalNumber (Fintype.card V) H- Cited by
- 1 results in Mathlib
- Foundations
- Depth 78 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FintypeDecidableRel
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Fintypestatement and proof · cited by 7,736
- SimpleGraphstatement and proof · cited by 3,072
- Finset.cardstatement · cited by 2,327
- Fintype.cardstatement · cited by 1,386
- SimpleGraph.Adjstatement and proof · cited by 1,346
- Sym2statement · cited by 737
- SimpleGraph.edgeFinsetstatement · cited by 116
- SimpleGraph.Freestatement and proof · cited by 39
- SimpleGraph.extremalNumberstatement · cited by 23
- SimpleGraph.IsExtremalstatement and proof · cited by 9
- SimpleGraph.isExtremal_free_iffproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.extremalNumber_topproof · cited by 0