The rate of growth of the minimum clique size of graphs of given order and chromatic number

DOI10.1016/j.disc.2014.12.012zbMath1306.05053arXiv1210.0412OpenAlexW2025372490MaRDI QIDQ2514156

Kris Wease, Csaba Biró

Publication date: 30 January 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey numberchromatic numberclique number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Large chromatic number and Ramsey graphs
• Minimum clique number, chromatic number, and Ramsey numbers
• The chromatic gap and its extremes

This page was built for publication: The rate of growth of the minimum clique size of graphs of given order and chromatic number