Theorems · Theorem · combinatorics
Graph.IsLink.adj
∀ {α : Type u_1} {β : Type u_2} {x y : α} {e : β} {G : Graph α β}, G.IsLink e x y → G.Adj x y- Defined in
- Mathlib.Combinatorics.Graph.Basic
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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.IsLinkstatement and proof · cited by 124
- Graph.Adjstatement · cited by 23
Cited by5
Results whose statement or proof uses this declaration.
- Graph.Adj.monoproof · cited by 4
- Graph.loopless_iff_forall_ne_of_adjproof · cited by 1
- Graph.IsClosedSubgraph.adj_congrproof · cited by 0
- Graph.IsInducedSubgraph.adj_congrproof · cited by 0
- Graph.vertexSet_nontrivial_of_edgeSet_nonempty_of_looplessproof · cited by 0