Chromatic numbers of spaces with forbidden monochromatic triangles

DOI10.1134/S0001434613010161zbMath1330.05076MaRDI QIDQ1947779

D. V. Samirov, Andrei M. Raigorodskii

Publication date: 26 April 2013

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

zbMATH Keywords

forbidden distance; chromatic number of space; space coloring

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

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, 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 number of edges of a uniform hypergraph with a range of allowed intersections, New lower bounds for the chromatic number of a space with forbidden isosceles triangles, On the number of edges in a uniform hypergraph with a range of permitted intersections

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm
• Intersection theorems with geometric consequences
• Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
• Borsuk's problem and the chromatic numbers of some metric spaces
• Research Problems in Discrete Geometry
• Chromatic numbers of real and rational spaces with real or rational forbidden distances
• On the chromatic number of a space
• The chromatic number of a space with the metric $ l_q$
• The realization of distances within sets in Euclidean space