The chromatic gap and its extremes

DOI10.1016/j.jctb.2012.06.001zbMath1253.05068arXiv1108.3444MaRDI QIDQ713979

Nicolas Trotignon, András Gyárfás, András Sebő

Publication date: 19 October 2012

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey numbers; chromatic number; clique number

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C15: Coloring of graphs and hypergraphs

05C55: Generalized Ramsey theory

Related Items

A small step forwards on the Erdős-Sós problem concerning the Ramsey numbers \(R(3, k)\), Large chromatic number and Ramsey graphs, On Ramsey numbers \(R(K_4-e, K_t)\), On zero-error codes produced by greedy algorithms, Bounded clique cover of some sparse graphs, Triangle packings and transversals of some \(K_{4}\)-free graphs, Chromatic Gallai identities operating on Lovász number, The rate of growth of the minimum clique size of graphs of given order and chromatic number

Cites Work

• New lower bounds for seven classical Ramsey numbers \(R(3,q)\)
• Matching theory
• Progress on perfect graphs
• Critical graphs with connected complements
• Faster recognition of clique-Helly and hereditary clique-Helly graphs
• A constructive approach for the lower bounds on the Ramsey numbersR (s, t)
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Sur le coloriage des graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item