Theorems · Theorem · combinatorics
Graph.IsLink.ne
∀ {α : Type u_1} {β : Type u_2} {G : Graph α β} {u v : α} {e : β} [G.Loopless], G.IsLink e u v → u ≠ v- Defined in
- Mathlib.Combinatorics.Graph.Simple
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 7 from the axioms · uses no axioms
- Assumes
- Graph.Loopless
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
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.Looplessstatement and proof · cited by 12
- Graph.Adj.neproof · cited by 3
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.