Theorems · Theorem · combinatorics
Graph.restrict_le
∀ {α : Type u_1} {β : Type u_2} {G : Graph α β} {E₀ : Set β}, G.restrict E₀ ≤ G- Defined in
- Mathlib.Combinatorics.Graph.Delete
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 59 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- le_rflproof · cited by 1,558
- Graphstatement and proof · cited by 242
- Graph.IsLinkproof · cited by 124
- Graph.restrictstatement · cited by 18
- Graph.restrict_isLinkproof · cited by 3
Cited by4
Results whose statement or proof uses this declaration.
- Graph.restrict_restrictproof · cited by 1
- Graph.restrict_mono_leftproof · cited by 1
- Graph.restrict_eq_deleteEdgesproof · cited by 0
- Graph.restrict_eq_self_iffproof · cited by 0