Minimum clique number, chromatic number, and Ramsey numbers
From MaRDI portal
Publication:426827
zbMath1243.05122MaRDI QIDQ426827
Publication date: 12 June 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p55
05C35: Extremal problems in graph theory
05C55: Generalized Ramsey theory
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05D10: Ramsey theory
Related Items
Large chromatic number and Ramsey graphs, The rate of growth of the minimum clique size of graphs of given order and chromatic number