Small clique and large chromatic number

DOI10.1016/j.endm.2009.07.073zbMath1273.05166OpenAlexW2004280815MaRDI QIDQ2851500

O. I. Rubanov, Andrei M. Raigorodskii

Publication date: 10 October 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.073

zbMATH Keywords

Ramsey theorychromatic numbersclique numbersdistance graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Lower bounds for the chromatic numbers of distance graphs with large girth ⋮ On the chromatic numbers of rational spaces ⋮ Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size ⋮ The chromatic number of space with forbidden regular simplex

Cites Work

• A 15-colouring of 3-space omitting distance one
• On the space chromatic number
• Research Problems in Discrete Geometry
• Graph Theory and Probability
• The realization of distances within sets in Euclidean space
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Small clique and large chromatic number