Theorems · Definition · combinatorics
Graph.Adj
{α : Type u_1} → {β : Type u_2} → Graph α β → α → α → PropG.Adj x y means that G has an edge whose ends are the vertices x and y.
- Defined in
- Mathlib.Combinatorics.Graph.Basic
- Cited by
- 23 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 by24
Results whose statement or proof uses this declaration.
- Graph.IsLink.adjstatement · cited by 5
- Graph.Adj.monostatement and proof · cited by 4
- Graph.toSimpleGraphproof · cited by 3
- Graph.Adj.nestatement and proof · cited by 3
- Graph.Adj.symmstatement and proof · cited by 2
- Graph.IsClosedSubgraph.mem_iff_of_adjstatement and proof · cited by 1
- Graph.toSimpleGraph_adjstatement · cited by 1
- Graph.IsInducedSubgraph.not_isClosedSubgraph_iff_exists_adjstatement and proof · cited by 1
- Graph.loopless_iff_forall_ne_of_adjstatement and proof · cited by 1
- Graph.Adj.left_memstatement and proof · cited by 1
- Graph.not_adj_selfstatement and proof · cited by 1
- Graph.adj_commstatement · cited by 0