Tight bounds on the clique chromatic number
DOI10.37236/9659OpenAlexW3036334018MaRDI QIDQ820840FDOQ820840
Authors: Gwenaël Joret, Piotr Micek, Bruce Reed, Michiel 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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Perfect graphs of arbitrarily large clique-chromatic number
- The Ramsey number R(3, t) has order of magnitude t2/log t
- The Grötzsch theorem for the hypergraph of maximal cliques
- Coloring the Maximal Cliques of Graphs
- Two-colouring all two-element maximal antichains
- On the divisibility of graphs
- Fibres and ordered set coloring
- Clique coloring of binomial random graphs
- Unsolved graph colouring problems
- The list chromatic number of graphs with small clique number
Cited In (17)
- A tight bound on the set chromatic number
- More results on clique-chromatic numbers of graphs with no long path
- Tight Bounds on the Clique Chromatic Number
- Tight asymptotics of clique‐chromatic numbers of dense random graphs
- A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs
- On graphs with linear Ramsey numbers
- Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques
- Coloring Graphs with Dense Neighborhoods
- New bounds on clique-chromatic numbers of Johnson graphs
- New bounds for the clique-chromatic numbers of Johnson graphs
- Clique coloring of dense random graphs
- The jump of the clique chromatic number of random graphs
- On Cliques and Clique Chromatic Numbers in Line, Lict and Lictact Graphs
- Title not available (Why is that?)
- Clique coloring of binomial random graphs
- Graphs with large clique-chromatic numbers
- Chromatic number versus chromatic number in graphs with bounded clique number
This page was built for publication: Tight bounds on the clique chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820840)
