The chromatic number of space with forbidden regular simplex

Cites Work

Research Problems in Discrete Geometry
Forbidden Intersections
Intersection theorems with geometric consequences
The difference between consecutive primes. II
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?)
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?)
Distance graphs with large chromatic numbers and small clique numbers
Title not available (Why is that?)
All Triangles are Ramsey
New bounds for the chromatic number of a space with forbidden isosceles triangles
Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections
A Partition Property of Simplices in Euclidean Space
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
On the chromatic numbers of low-dimensional spaces
Lower bounds for the chromatic numbers of distance graphs with large girth
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

Cited In (6)

On the Frankl-Rödl theorem
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
On the chromatic number of a space with a forbidden regular simplex
Counterexamples to Borsuk's conjecture with large girth

This page was built for publication: The chromatic number of space with forbidden regular simplex

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