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

DOI10.1134/S0001434617030130zbMATH Open1367.05080OpenAlexW2608276980MaRDI QIDQ2364552FDOQ2364552

Authors: 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

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

Cites Work

• Research Problems in Discrete Geometry
• Graph Theory and Probability
• Forbidden Intersections
• Around Borsuk's hypothesis
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring distance graphs and graphs of diameters
• The Mathematical Coloring Book
• Title not available (Why is that?)
• On the chromatic number of a space
• The realization of distances within sets in Euclidean space
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• On the chromatic number of a space with forbidden equilateral triangle
• 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
• Small clique and large chromatic number
• Title not available (Why is that?)
• On distance graphs with large chromatic number but without large simplices
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364552)