Theorems · Inductive type · combinatorics
Graph.Loopless
{α : Type u_1} → {β : Type u_2} → Graph α β → PropA loopless graph is one where the ends of every edge are distinct.
- Defined in
- Mathlib.Combinatorics.Graph.Simple
- Cited by
- 12 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Graphstatement · cited by 242
Cited by16
Results whose statement or proof uses this declaration.
- Graph.Adj.nestatement and proof · cited by 3
- Graph.Loopless.not_isLoopAtstatement and proof · cited by 3
- Graph.loopless_iff_forall_ne_of_adjstatement and proof · cited by 1
- Graph.Loopless.casesOnstatement and proof · cited by 1
- Graph.Simple.casesOnstatement and proof · cited by 1
- Graph.not_adj_selfstatement and proof · cited by 1
- Graph.not_isLoopAtstatement and proof · cited by 0
- Graph.Inc.isNonloopAtstatement and proof · cited by 0
- Graph.simple_iffstatement and proof · cited by 0
- Graph.toSimpleGraph_adj_iffstatement and proof · cited by 0
- Graph.IsLink.nestatement and proof · cited by 0
- Graph.loopless_iffstatement and proof · cited by 0