Theorems · Definition · combinatorics
Graph.IsLink
{α : Type u_3} → {β : Type u_4} → Graph α β → β → α → α → PropThe binary incidence predicate, stating that x and y are the ends of an edge e.
If G.IsLink e x y then we refer to e as edge and x and y as left and right.
- Defined in
- Mathlib.Combinatorics.Graph.Basic
- Cited by
- 124 results in Mathlib
- Foundations
- Depth 1 from the axioms, rests on 2 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Graphstatement and proof · cited by 242
Cited by139
Results whose statement or proof uses this declaration.
- Graph.Incproof · cited by 42
- Graph.IsLoopAtproof · cited by 29
- Graph.Adjproof · cited by 23
- Graph.Compatibleproof · cited by 21
- Graph.restrictproof · cited by 18
- Graph.IsNonloopAtproof · cited by 16
- Graph.mapproof · cited by 16
- Graph.IsLink.edge_memstatement and proof · cited by 14
- Graph.IsLink.left_memstatement and proof · cited by 14
- Graph.IsLink.monostatement and proof · cited by 11
- Graph.IsLink.symmstatement and proof · cited by 11
- Graph.extstatement and proof · cited by 10