Theorems · Theorem · combinatorics
SimpleGraph.Copy.maxDegree_mono
∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} [inst : Fintype V] [inst_1 : Fintype W]
[inst_2 : DecidableRel G.Adj] [inst_3 : DecidableRel H.Adj] (f : G.Copy H), G.maxDegree ≤ H.maxDegree- Defined in
- Mathlib.Combinatorics.SimpleGraph.Copy
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 83 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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
- SimpleGraph.Adjstatement and proof · cited by 1,346
- IsEmptyproof · cited by 759
- isEmpty_or_nonemptyproof · cited by 269
- SimpleGraph.degreeproof · cited by 112
- SimpleGraph.Copystatement and proof · cited by 49
- SimpleGraph.maxDegreestatement and proof · cited by 19
- SimpleGraph.maxDegree_of_subsingletonproof · cited by 5
- SimpleGraph.exists_maximal_degree_vertexproof · cited by 3
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.IsContained.maxDegree_monoproof · cited by 2
- SimpleGraph.maxDegree_induce_of_support_subsetproof · cited by 0
- SimpleGraph.Copy.max_degree_leproof · cited by 0