Abstract
The present paper is devoted to the study of the properties of distance graphs in Euclidean space. We prove, in particular, the existence of distance graphs with chromatic number of exponentially large dimension and without cliques of dimension 6. In addition, under a given constraint on the cardinality of the maximal clique, we search for distance graphs with extremal large values of the chromatic number. The resulting estimates are best possible within the framework of the proposed method, which combines probabilistic techniques with the linear-algebraic approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. M. Raigorodskii, “Borsuk’s problem and the chromatic numbers of some metric spaces,” Uspekhi Mat. Nauk 56(1), 107–146 (2001) [RussianMath. Surveys 56 (1), 103–139 (2001)].
A. Soifer, “The chromatic number of the plane: its past, present, and future,” in Mathematical Education (MTsNMO, Moscow, 2004), Vol. 8, pp. 185–221 [in Russian].
A. M. Raigorodskii, Linear Algebraic Method in Combinatorics (MTsNMO, Moscow, 2007) [in Russian].
A. M. Raigorodskii, Chromatic Numbers (MTsNMO, Moscow, 2003) [in Russian].
L. A. Székely, “Erdős on the unit distances and the Szemerédi-Trotter theorems,” in Paul Erdős and his Mathematics, II, Bolyai Soc. Math. Stud., Budapest, 1999 (János Bolyai Math. Soc., Budapest, 2002), Vol. 11, pp. 649–666.
P. Brass, W. Moser, and J. Pach, Research Problems in Discrete Geometry (Springer-Verlag, New York, NY, 2005).
F. Harary, Graph Theory (Addison-Wesley, Reading, 1969; Mir, Moscow, 1973).
D. G. Larman and C. A. Rogers, “The realization of distances within sets in Euclidean space,” Mathematika 19, 1–24 (1972).
N. G. de Bruijn and P. Erdős, “A colour problem for infinite graphs and a problem in the theory of relations,” Nederl. Akad. Wetensch. Proc. Ser. A 54(5), 371–373 (1951).
O. Nechushtan, “On the space chromatic number,” Discrete Math. 256(1–2), 499–507 (2002).
L. L. Ivanov, “An estimate for the chromatic number of the space ℝ4,” Uspekhi Mat. Nauk 61(5), 181–182 (2006) [Russian Math. Surveys 61 (5), 984–986 (2006)].
A. M. Raigorodskii, “On the chromatic number of a space,” Uspekhi Mat. Nauk 55(2), 147–148 (2000) [Russian Math. Surveys 55 (2), 351–352 (2000)].
“Unsolved problems,” Congr. Numer. 15, 678–691 (1976).
N. Wormald, “A 4-chromatic graph with a special plane drawing,” J. Austral. Math. Soc. Ser. A 28(1), 1–8 (1979).
R. Hochberg and P. O’Donnel, “Some 4-chromatic the unit-distance graphs without small cycles,” Geombinatorics 5(4), 137–141 (1996).
O. I. Rubanov, “Chromatic numbers of 3-dimensional distance graphs containing no tetrahedra,” Mat. Zametki 82(5), 797–800 (2007) [Math. Notes 82 (5–6), 718–721 (2007)].
K. Prakhar, Primzahlverteilung (Springer-Verlag, Berlin-Heidelberg, 1957; Mir, Moscow, 1967).
N. Alon and J. Spencer, The Probabilistic Method, 2nd ed. (Wiley, Chichester, 2000, Binom, Moscow, 2007).
A. M. Raigorodskii, Probability and Algebra in Combinatorics (MTsNMO, Moscow, 2008) [in Russian].
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A. M. Raigorodskii, O. I. Rubanov, 2010, published in Matematicheskie Zametki, 2010, Vol. 87, No. 3, pp. 417–428.
Rights and permissions
About this article
Cite this article
Raigorodskii, A.M., Rubanov, O.I. Distance graphs with large chromatic number and without large cliques. Math Notes 87, 392–402 (2010). https://doi.org/10.1134/S0001434610030119
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0001434610030119