Distance graphs with large chromatic number and without cliques of given size in the rational space

DOI10.1134/S0001434619070046zbMath1429.05052OpenAlexW2970056884WikidataQ127330642 ScholiaQ127330642MaRDI QIDQ2282833

Yury A. Demidovich

Publication date: 20 December 2019

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434619070046

zbMATH Keywords

chromatic numberdistance graphclique number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (1)

Chromatic numbers of distance graphs without short odd cycles in rational spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lovász' theorem on the chromatic number of spheres revisited
• Estimate for the chromatic number of Euclidean space with several forbidden distances
• Turán type results for distance graphs
• Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distance
• The chromatic number of space with forbidden regular simplex
• On lower bounds for the chromatic number of sphere
• Intersection theorems with geometric consequences
• On a Frankl-Rödl theorem and its geometric corollaries
• Distance graphs with large chromatic numbers and small clique numbers
• Distance graphs with large chromatic number and without large cliques
• On lower bounds for the chromatic number of spheres
• Counterexamples to Borsuk's conjecture with large girth
• New lower bound for the chromatic number of a rational space with one and two forbidden distances
• On the chromatic numbers of low-dimensional spaces
• On the chromatic number of a space with a forbidden regular simplex
• Lower bounds for the chromatic numbers of distance graphs with large girth
• Improvements of the Frankl-Rödl theorem and geometric consequences
• Turán-type bounds for distance graphs
• The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs
• Distances realized by sets covering the plane
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring Distance Graphs and Graphs of Diameters
• On distance graphs with large chromatic number but without large simplices
• On the chromatic number of an infinitesimal plane layer
• The chromatic number of a space with the metric $ l_q$
• Combinatorial Geometry and Coding Theory*
• A new lower bound for the chromatic number of the rational space
• Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
• The realization of distances within sets in Euclidean space
• On the chromatic numbers of small-dimensional Euclidean spaces

This page was built for publication: Distance graphs with large chromatic number and without cliques of given size in the rational space