Theorems · Theorem · combinatorics
Graph.Inc.of_compatible
∀ {α : Type u_1} {β : Type u_2} {x : α} {e : β} {G H : Graph α β},
G.Compatible H → e ∈ H.edgeSet → G.Inc e x → H.Inc e x- Defined in
- Mathlib.Combinatorics.Graph.Basic
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 7 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Graphstatement and proof · cited by 242
- Graph.IsLinkproof · cited by 124
- Graph.edgeSetstatement and proof · cited by 79
- Graph.Incstatement and proof · cited by 42
- Graph.Compatiblestatement and proof · cited by 21
- Graph.IsLink.of_compatibleproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- Graph.IsClosedSubgraph.inc_congrproof · cited by 2
- Graph.IsClosedSubgraph.transproof · cited by 0