Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.degree_le
∀ {V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) (v : V) [inst : Fintype ↑(G'.neighborSet v)]
[inst_1 : Fintype ↑(G.neighborSet v)], G'.degree v ≤ G.degree v- Cited by
- 0 results in Mathlib
- Foundations
- Depth 82 from the axioms · uses propext, Classical.choice, Quot.sound
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
- Set.Elemstatement and proof · cited by 7,166
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.neighborSetstatement and proof · cited by 257
- SimpleGraph.degreestatement · cited by 112
- SimpleGraph.Subgraph.neighborSetstatement and proof · cited by 46
- SimpleGraph.Subgraph.degreestatement and proof · cited by 14
- SimpleGraph.card_neighborSet_eq_degreeproof · cited by 9
- Set.card_le_cardproof · cited by 5
- SimpleGraph.Subgraph.neighborSet_subsetproof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.