Theorems · Theorem · combinatorics
Graph.Adj.ne
∀ {α : Type u_1} {β : Type u_2} {G : Graph α β} {u v : α} [G.Loopless], G.Adj u v → u ≠ v- Defined in
- Mathlib.Combinatorics.Graph.Simple
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 6 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.Adjstatement and proof · cited by 23
- Graph.Looplessstatement and proof · cited by 12
- Graph.not_adj_selfproof · cited by 1
Cited by3
Results whose statement or proof uses this declaration.
- Graph.loopless_iff_forall_ne_of_adjproof · cited by 1
- Graph.IsLink.neproof · cited by 0
- Graph.vertexSet_nontrivial_of_edgeSet_nonempty_of_looplessproof · cited by 0