Theorems · Theorem · combinatorics
Graph.loopless_iff
∀ {α : Type u_1} {β : Type u_2} (G : Graph α β), G.Loopless ↔ ∀ (e : β) (x : α), ¬G.IsLoopAt e x- Defined in
- Mathlib.Combinatorics.Graph.Simple
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 6 from the axioms · uses no axioms
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.IsLoopAtstatement and proof · cited by 29
- Graph.Looplessstatement and proof · cited by 12
- Graph.Loopless.casesOnproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.