Theorems · Theorem · combinatorics
SimpleGraph.Iso.maxDegree_eq
∀ {V : Type u_1} {G : SimpleGraph V} {W : Type u_2} {G' : SimpleGraph W} [inst : Fintype V]
[inst_1 : DecidableRel G.Adj] [inst_2 : Fintype W] [inst_3 : DecidableRel G'.Adj] (f : G ≃g G'),
G.maxDegree = G'.maxDegree- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 77 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites16
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
- Fintypestatement and proof · cited by 7,736
- Finset.univproof · cited by 3,473
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- Finset.imageproof · cited by 910
- SimpleGraph.degreeproof · cited by 112
- SimpleGraph.Isostatement and proof · cited by 99
- Finset.maxproof · cited by 50
- WithBot.unbotDproof · cited by 49
- SimpleGraph.maxDegreestatement and proof · cited by 19
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.