3 problems

Let $\mathcal{C}(G)$ denote the cycle spectrum of a graph $G$, and let the circumference of $G$ be the length of its longest cycle. Bounded-gap conjecture. There exists…

Let $\mathcal{C}(G)$ denote the cycle spectrum of a graph $G$, and let the circumference of $G$ be the length of its longest cycle. Conjecture on optimal gaps. If $k\in\mathbb{N}$…

Faudree–Gould–Jacobson–Magnant conjecture. If $G$ is a 2-connected graph on $n\geq 2d$ vertices with minimum degree $\delta(G)=d$, then