Tight bounds on the clique chromatic number

DOI10.37236/9659OpenAlexW3036334018MaRDI QIDQ820840

Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel H. M. Smid

Publication date: 28 September 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.11353

zbMATH Keywords

perfect graphsclique colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

The jump of the clique chromatic number of random graphs

Cites Work

• Perfect graphs of arbitrarily large clique-chromatic number
• Two-colouring all two-element maximal antichains
• Fibres and ordered set coloring
• The Grötzsch theorem for the hypergraph of maximal cliques
• The list chromatic number of graphs with small clique number
• Coloring the Maximal Cliques of Graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Clique coloring of binomial random graphs
• On the divisibility of graphs
• Unnamed Item