Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.girth_eq_zero

∀ {α : Type u_1} {G : SimpleGraph α}, G.girth = 0 ↔ G.IsAcyclic
Defined in
Mathlib.Combinatorics.SimpleGraph.Girth
Cited by
1 results in Mathlib
Foundations
Depth 54 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

SimpleGraph.IsAcyclic.girth_eq_zero · cited by 0IsAcyclic.girth_eq_zeroSimpleGraph · cited by 3072SimpleGraphSimpleGraph.IsAcyclic · cited by 67SimpleGraph.IsAcyclicFunction.mt · cited by 27Function.mtSimpleGraph.egirth · cited by 17SimpleGraph.egirthSimpleGraph.girth · cited by 11SimpleGraph.girthSimpleGraph.three_le_girth · cited by 1SimpleGraph.three_le_girthSimpleGraph.girth_eq_zeroCITED BYCITES

Cites6

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.