Theorems · Theorem · combinatorics
Graph.not_adj_self
∀ {α : Type u_1} {β : Type u_2} (G : Graph α β) [G.Loopless] (x : α), ¬G.Adj x x- Defined in
- Mathlib.Combinatorics.Graph.Simple
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 5 from the axioms · uses no axioms
- Assumes
- Graph.Loopless
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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
- Graph.Adjstatement and proof · cited by 23
- Graph.Looplessstatement and proof · cited by 12
- Graph.Loopless.not_isLoopAtproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- Graph.Adj.neproof · cited by 3