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/

Global: Zendy Tools annual

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

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

An odd hole in a graph is an induced subgraph which is a cycle of odd lengthat least five. In 1985, A. Gyarfas made the conjecture that for all t thereexists n such that every graph with no K_t subgraph and no odd hole isn-colourable. We prove this conjecture.

Induced subgraphs of graphs with large chromatic number. I. Odd holes