Abstract
We study distance graphs with exponentially large chromatic number which do not contain cliques of prescribed size in the rational space.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
E. E. Demekhin, A. M. Raigorodskii, and O. I. Rubanov, “Distance graphs having large chromatic numbers and containing no cliques or cycles of a given size,” Mat. Sb. 204(4), 49–78 (2013) [Sb. Math. 204 (4), 508–538 (2013)].
A. M. Raigorodskii, “Borsuk’s problem and the chromatic numbers of some metric spaces,” Uspekhi Mat. Nauk 56(1(337)), 107–146 (2001) [Russian Math. Surveys 56 (1), 103–139 (2001)].
M. Benda and M. Perles, “Colorings of metric spaces,” Geombinatorics 9(3), 113–126 (2000)
D. R. Woodall, “Distances realized by sets covering the plane,” J. Combin. Theory Ser. A, No. 14, 187–200 (1973).
J. Cibulka, “On the chromatic number of real and rational spaces,” Geombinatorics 18(2), 53–66 (2008).
K. Chilakamarri, “The unit-distance graph problem: a brief survey and some new results,” Bull. Inst. Combin. Appl. 8, 39–60 (1993).
M. Mann, “Hunting the unit-distance graphs in rational n-spaces,” Geombinatorics 13(2), 49–53 (2003)
D. Cherkashin, A. Kulikov, and A. Raigorodskii, “On the chromatic numbers of small-dimensional Euclidean spaces,” Discrete Appl. Math. 243, 125–131 (2018).
D. D. Cherkashin and A. M. Raigorodskii, “On the chromatic numbers of the spaces of small dimension,” Dokl. Akad. Nauk[Dokl. Math.] Akad. Nauk 472(1), 11–12 (2017)
A. M. Raigorodskii, “The chromatic number of a space with the metric l q,” Uspekhi Mat. Nauk 59(5 (359)), 161–162 (2004) [Russian Math. Surveys 59 (5), 973–975 (2004)].
E. I. Ponomarenko and A. M. Raigorodskii, “A new lower bound for the chromatic number of the rational space,” Uspekhi Mat. Nauk 68(5(413)), 183–184 (2013) [Russian Math. Surveys 68 (5), 960–962(2013)]
E. I. Ponomarenko and A. M. Raigorodskii, “New lower bound for the chromatic number of a rational space with one and two forbidden distances,” Mat. Zametki 97(2), 255–261 (2015) [Math. Notes 97 (2), 249–254 (2015)].
D. G. Larman and C. A. Rogers, “The realization distances within sets in Euclidean space,” Mathematika 19, 1–24 (1972).
Yu. A. Demidovich, “Lower bound for the chromatic number of a rational space with metric l u and with one forbidden distance,” Mat. Zametki 102(4), 532–548 (2017) [Math. Notes 102 (4), 492–507 (2017)].
A. B. Kupavskii, “Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers,” Izv. Ross. Akad. Nauk Ser. Mat. 78(1), 65–98 (2014) [Izv. Math. 78 (1), 59–89 (2014)].
A. M. Raigorodskii, Linear-Algebraic Method in Combinatorics (MTsNMO, Moscow, 2015) [in Russian].
A. M. Raigorodskii, Chromatic Numbers (MTsNMO, Moscow, 2003) [in Russian].
A. M. Raigorodskii, “Coloring distance graphs and graphs of diameters,” in Thirty Essays on Geometric Graph Theory (Springer, New York, 2013), pp. 429–460.
P. Frankl and R. M. Wilson, “Intersection theorems with geometric consequences,” Combinatorica 1(4), 357–368 (1981).
L. A. Szekely, “Erdos on the unit distances and the Szemeredi-Trotter theorems,” in Paul Erdös and his mathematics. II, Bolyai Soc. Math. Stud. (János Bolyai Math. Soc., Budapest, 2002), Vol. 11, pp. 649–666.
A. Soifer, “The chromatic number of a plane: Its past, present, and future,” in Matem. Prosv., Ser. 3(Izd. MTsNMO, Moscow, 2004), Vol. 8, pp. 186–221 [in Russian].
A. V. Berdnikov, “Estimate for the chromatic number of Euclidean space with several forbidden distances,” Mat. Zametki 99(5), 783–787 (2016) [Math. Notes 99 (5), 774–778 (2016)]
A. M. Raigorodskii and A. A. Sagdeev, “On the chromatic number of a space with a forbidden regular simplex,” Dokl. Akad. Nauk 472(2), 127–129 (2017) [Dokl. Math. 95 (1), 15–16 (2017)]
A. A. Sagdeev, “The chromatic number of space with forbidden regular simplex,” Mat. Zametki 102(4), 579–585 (2017) [Math. Notes 102 (4), 541–546(2017)].
A. A. Sagdeev, “Lower bounds for the chromatic numbers of distance graphs with large girth,” Mat. Zametki 101(3), 430–445 (2017) [Math. Notes 101 (3), 515–528 (2017)].
R. I. Prosanov, A. M. Raigorodskii, and A. A. Sagdeev, “Improvements of the Frankl-Rödl theorem and the geometric consequences,” Dokl. Akad. Nauk 475(2), 137–139 (2017) [Dokl. Math. 96 (1), 336–338 (2017)].
A. A. Sagdeev, “On a Frankl-Rödl theorem and its geometric corollaries,” Electron. Notes in Discrete Math. 61(2), 1033–1037 (2017).
L. E. Shabanov and A. M. Raigorodskii, “Turán type results for distance graphs,” Discrete Comput. Geom. 56(3), 814–832 (2016).
L. É. Shabanov and A. M. Raigorodskii, “Turán estimates for distance graphs,” Dokl. Akad. Nauk 475(3), 254–256 (2017).
O. A. Kostina and A. M. Raigorodskii, “On the lower bounds for the chromatic number of sphere,” Dokl. Akad. Nauk 463(6), 639–641 (2015).
O. A. Kostina, “On lower bounds for the chromatic number of spheres,” Mat. Zametki 105(1), 18–31 (2019) [Math. Notes 105 (1), 16–27(2019)].
A. M. Raigorodskii, “Lovaśz’ theorem on the chromatic number of spheres revisited,” Mat. Zametki 98(3), 470–471 (2015) [Math. Notes 98 (3), 522–524 (2015)].
A. M. Raigorodskii, “Combinatorial geometry and coding theory,” Fund. Inform. 145(3), 359–369 (2016).
A. Ya. Kanel’-Belov, V. A. Voronov, and D. D. Cherkashin, “On the chromatic number of infinitesimal plane layer,” Algebra Anal. 29(5), 68–89 (2017) [St. Petersburg Math. J. 29 (5), 761–775 (2018)]
A. M. Raigorodskii, “Cliques and cycles in distance graphs and graphs of diameters,” in Discrete Geometry and Algebraic Combinatorics, Contemp. Math. (Amer. Math. Soc., Providence, RI, 2014), Vol. 625, pp. 93–109.
R. I. Prosanov, “Counterexamples to Borsuk’s conjecture with large girth,” Mat. Zametki 105(6), 890–898 (2019) [Math. Notes 105 (6), 87473x2013;880(2019)].
A. A. Sagdeev and A. M. Raigorodskii, “On a Frankl—Wilson theorem and its geometric corollaries,” Acta Math. Univ. Comenian. (N. S.) (in press).
A. M. Raigorodskii, “On distance graphs with large chromatic number but without large simplices,” Uspekhi Mat. Nauk 62(6(378)), 187–188 (2007) [Russian Math. Surveys 62 (6), 1224–1225 (2007)].
A. M. Raigorodskii and O. I. Rubanov, “On the clique and the chromatic numbers of high-dimensional distance graphs,” in Number Theory and Applications (Hindustan Book Agency, New Delhi, 2009), pp. 149–155.
A. M. Raigorodskii and O. I. Rubanov, “Distance graphs with large chromatic number and without large cliques,” Mat. Zametki 87(3), 417–428 (2010) [Math. Notes 87 (3), 392–402 (2010)].
N. Alon and J. H. Spencer, Probabilistic Method (Wiley-Interscience, New York, 2000).
B. Bollobás, Random Graphs, in Cambridge Stud. Adv. Math. (Cambridge Univ. Press, Cambridge, 2001), Vol. 73.
A. M. Raigorodskii, Probability and Algebra in Combinatorics (MTsNMO, Moscow, 2008) [in Russian].
Author information
Authors and Affiliations
Corresponding author
Additional information
Russian Text © The Author(s), 2019, published in Matematicheskie Zametki, 2019, Vol. 106, No. 1, pp. 24–39.
Rights and permissions
About this article
Cite this article
Demidovich, Y.A. Distance Graphs with Large Chromatic Number and without Cliques of Given Size in the Rational Space. Math Notes 106, 38–51 (2019). https://doi.org/10.1134/S0001434619070046
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0001434619070046