Large chromatic number and Ramsey graphs

DOI10.1007/s00373-012-1179-6zbMath1272.05147arXiv1103.3917OpenAlexW2053825204MaRDI QIDQ367059

Csaba Biró, Sogol Jahanbekam, Zoltan Fueredi

Publication date: 26 September 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberclique numberRamsey graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10)

Related Items (3)

Forcing posets with large dimension to contain large standard examples ⋮ The rate of growth of the minimum clique size of graphs of given order and chromatic number ⋮ Standard examples as subposets of posets.

Cites Work

• Minimum clique number, chromatic number, and Ramsey numbers
• The chromatic gap and its extremes
• Matching theory
• A note on Ramsey numbers
• Small Ramsey numbers
• Maximal dimensional partially ordered sets. II: Characterization of 2n- element posets with dimension n
• 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
• Unnamed Item

This page was built for publication: Large chromatic number and Ramsey graphs