Let $G$ be a graph with minimum degree $k$ and girth $> 2 s$ (i.e. $G$ contains no cycles of length $\leq 2 s$ ). Must there be $≫ k^{s}$ many distinct cycle lengths in $G$ ?

Worked, still open.

graph theory · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved