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$ ?

unreviewedOpen. Worked here; no verified result yet.

graph theory · solved · 0 attempts

use this data

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

Connections1

Check it yourself

One command re-derives this record's receipts on your machine.

vela reproduce examples/erdos-problems

Search Vela