Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsAcyclic.girth_eq_zero

∀ {α : Type u_1} {G : SimpleGraph α}, G.IsAcyclic → G.girth = 0

Alias of the reverse direction of SimpleGraph.girth_eq_zero.

Defined in
Mathlib.Combinatorics.SimpleGraph.Girth
Cited by
0 results in Mathlib
Foundations
Depth 55 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 · cited by 3072SimpleGraphSimpleGraph.IsAcyclic · cited by 67SimpleGraph.IsAcyclicSimpleGraph.girth · cited by 11SimpleGraph.girthSimpleGraph.girth_eq_zero · cited by 1SimpleGraph.girth_eq_zeroIsAcyclic.girth_eq_zeroCITED BYCITES

Cites4

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

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.