Theorems · Definition · combinatorics
Graph.Inc
{α : Type u_1} → {β : Type u_2} → Graph α β → β → α → PropThe unary incidence predicate of G. G.Inc e x means that the vertex x
is one or both of the ends of the edge e.
In the Inc namespace, we use edge and vertex to refer to e and x.
- Defined in
- Mathlib.Combinatorics.Graph.Basic
- Cited by
- 42 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Graphstatement and proof · cited by 242
- Graph.IsLinkproof · cited by 124
Cited by46
Results whose statement or proof uses this declaration.
- Graph.IsLink.inc_leftstatement · cited by 8
- Graph.Inc.edge_memstatement and proof · cited by 6
- Graph.Inc.eq_or_eq_of_isLinkstatement and proof · cited by 3
- Graph.Inc.vertex_memstatement and proof · cited by 3
- Graph.IsClosedSubgraph.mk'statement and proof · cited by 3
- Graph.IsLink.inc_rightstatement · cited by 3
- Graph.incidenceSetproof · cited by 3
- Graph.IsNonloopAt.incstatement · cited by 3
- Graph.Inc.monostatement and proof · cited by 2
- Graph.Inc.of_compatiblestatement and proof · cited by 2
- Graph.Inc.otherstatement and proof · cited by 2
- Graph.IsClosedSubgraph.closedstatement · cited by 2