English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

Resolving a conjecture of Bollob\'{a}s and Erd\H{o}s, Gy\'{a}rf\'{a}s provedthat every graph $G$ of chromatic number $k+1\geq 3$ contains cycles of$\lfloor\frac{k}{2}\rfloor$ distinct odd lengths. We strengthen this prominentresult by showing that such $G$ contains cycles of $\lfloor\frac{k}{2}\rfloor$consecutive odd lengths. Along the way, combining extremal and structuraltools, we prove a stronger statement that every graph of chromatic number$k+1\geq 7$ contains $k$ cycles of consecutive lengths, except that some blockis $K_{k+1}$. As corollaries, this confirms a conjecture of Verstra\"ete andanswers a question of Moore and West.

A strengthening on odd cycles in graphs of given chromatic number