Theorems · Theorem · combinatorics
Graph.IsLink.of_compatible
∀ {α : Type u_1} {β : Type u_2} {x y : α} {e : β} {G H : Graph α β},
G.Compatible H → e ∈ H.edgeSet → G.IsLink e x y → H.IsLink e x y- Defined in
- Mathlib.Combinatorics.Graph.Basic
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 6 from the axioms · uses no axioms
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 · cited by 53,352
- Graphstatement and proof · cited by 242
- Graph.IsLinkstatement and proof · cited by 124
- Graph.edgeSetstatement and proof · cited by 79
- Graph.Compatiblestatement and proof · cited by 21
- Graph.IsLink.edge_memproof · cited by 14
Cited by3
Results whose statement or proof uses this declaration.
- Graph.Inc.of_compatibleproof · cited by 2
- Graph.IsNonloopAt.of_compatibleproof · cited by 0
- Graph.IsLoopAt.of_compatibleproof · cited by 0