On the chromatic number of a space with a forbidden regular simplex

DOI10.1134/S1064562417010082zbMath1365.05099MaRDI QIDQ2358587

A. A. Sagdeev, Andrei M. Raigorodskii

Publication date: 15 June 2017

Published in: Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

exponential lower bounds

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Turán-type results for distance graphs in an infinitesimal plane layer ⋮ 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 ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ On the Frankl–Rödl theorem ⋮ Chromatic numbers of spheres ⋮ Exponentially Ramsey sets ⋮ 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

• Borsuk's problem and the chromatic numbers of some metric spaces
• A Partition Property of Simplices in Euclidean Space
• All Triangles are Ramsey
• Forbidden Intersections
• On the chromatic number of a space
• On the chromatic number of a space with forbidden equilateral triangle
• Unnamed Item
• Unnamed Item

This page was built for publication: On the chromatic number of a space with a forbidden regular simplex