Lower bounds for the chromatic numbers of distance graphs with large girth

DOI10.1134/S0001434617030130zbMath1367.05080OpenAlexW2608276980MaRDI QIDQ2364552

A. A. Sagdeev

Publication date: 21 July 2017

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

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

zbMATH Keywords

chromatic numberdistance graphFrankl-Rödl theorem

Mathematics Subject Classification ID

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

Related Items (8)

Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets ⋮ Improvements of the Frankl-Rödl theorem and geometric consequences ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ On the Frankl–Rödl theorem ⋮ The chromatic number of space with forbidden regular simplex ⋮ Distance graphs with large chromatic number and without cliques of given size in the rational space ⋮ Improved Frankl-Rödl theorem and some of its geometric consequences ⋮ Counterexamples to Borsuk's conjecture with large girth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections
• Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle
• Distance graphs with large chromatic numbers and small clique numbers
• Distance graphs with large chromatic number and arbitrary girth
• Distance graphs with large chromatic number and without large cliques
• Two notions of unit distance graphs
• Around Borsuk's hypothesis
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring Distance Graphs and Graphs of Diameters
• Small clique and large chromatic number
• Research Problems in Discrete Geometry
• Graph Theory and Probability
• The Mathematical Coloring Book
• On distance graphs with large chromatic number but without large simplices
• Forbidden Intersections
• On the chromatic number of a space
• On the chromatic number of a space with forbidden equilateral triangle
• Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
• Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
• The realization of distances within sets in Euclidean space

This page was built for publication: Lower bounds for the chromatic numbers of distance graphs with large girth