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

Cites work

scientific article; zbMATH DE number 6009961 (Why is no real title available?)
scientific article; zbMATH DE number 6536189 (Why is no real title available?)
scientific article; zbMATH DE number 1017008 (Why is no real title available?)
scientific article; zbMATH DE number 1452727 (Why is no real title available?)
scientific article; zbMATH DE number 1406333 (Why is no real title available?)
scientific article; zbMATH DE number 3068973 (Why is no real title available?)
Around Borsuk's hypothesis
Borsuk's problem and the chromatic numbers of some metric spaces
Coloring distance graphs and graphs of diameters
Distance graphs with large chromatic number and arbitrary girth
Distance graphs with large chromatic number and without large cliques
Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
Forbidden Intersections
Graph Theory and Probability
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
Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
On distance graphs with large chromatic number but without large simplices
On the chromatic number of a space
On the chromatic number of a space with forbidden equilateral triangle
Research Problems in Discrete Geometry
Small clique and large chromatic number
The Mathematical Coloring Book
The realization of distances within sets in Euclidean space
Two notions of unit distance graphs

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
Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
On a Frankl-Wilson theorem and its geometric corollaries
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)