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 Plus annual

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

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

It is proved that every connected graph $G$ on $n$ vertices with $\chi(G)\geq 4$ has at most $k(k-1)^{n-3}(k-2)(k-3)$ $k$-colourings for every $k \geq4$. Equality holds for some (and then for every) $k$ if and only if the graphis formed from $K_4$ by repeatedly adding leaves. This confirms (astrengthening of) the $4$-chromatic case of a long-standing conjecture ofTomescu [Le nombre des graphes connexes $k$-chromatiques minimaux aux sommetsetiquetes, C. R. Acad. Sci. Paris 273 (1971), 1124-1126]. Proof methods may beof independent interest. In particular, one of our auxiliary results aboutlist-chromatic polynomials solves a recent conjecture of Brown, Erey, and Li.

Maximum number of colourings. I. 4-chromatic graphs