Distance graphs having large chromatic numbers and containing no cliques or cycles of a given size

Sbornik Mathematics

Volumn 204, Issue 4, 2013, Pages 508-538

  Demekhin, E E ^a   Raigorodskii A M ^a   Rubanov, O I ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

Chromatic number; Clique; Cycle; Distance graph; Random graph

Indexed keywords

EID: 84888343984     PISSN: 10645616     EISSN: 14684802     Source Type: Journal    
DOI: 10.1070/SM2013v204n04ABEH004310     Document Type: Article

References (52)

1. N. G. de Bruijn and P. Erdos, "A colour problem for infinite graphs and a problem in the theory of relations", Nederl. Akad. Wet. Proc. Ser. A 54:5 (1951), 371-373.
2. L. Moser and W. Moser, "Solution to problem 10", Canad. Math. Bull. 4 (1961), 187-189.
3. H. Hadwiger, "Ungeloste Probleme No. 40", Elem. Math. 16 (1961), 103-104.
4. A. M. Raigorodskii, Chromatic numbers, Moscow Center for Continuous Mathematical Education, Moscow 2003. (Russian).
5. O. Nechushtan, "On the space chromatic number", Discrete Math. 256:1-2 (2002), 499-507.
6. D. Coulson, "A 15-colouring of 3-space omitting distance one", Discrete Math. 256:1-2 (2002), 83-90.
7. K. Cantwell, "Finite Euclidean Ramsey theory", J. Combin. Theory Ser. A 73:2 (1996), 273-285. (Pubitemid 126652130)
8. L. L. Ivanov, "An estimate for the chromatic number of the space R4", Uspekhi Mat. Nauk 61:5 (2006), 181-182.
9. Russian Math. Surveys 61:5 (2006), 984-986.
10. R. Radoicic and G. Toth, "Note on the chromatic number of the space", Discrete and computational geometry, Algorithms Combin., vol. 25, Springer-Verlag, Berlin 2003, pp. 696-698.
11. A. M. Raigorodskii, "On the chromatic number of a space", Uspekhi Mat. Nauk 55:2 (2000), 147-148.
12. Russian Math. Surveys 55:2 (2000), 351-352.
13. D. G. Larman and C. A. Rogers, "The realization of distances within sets in Euclidean space", Mathematika 19 (1972), 1-24.
14. P. Frankl and R. M. Wilson, "Intersection theorems with geometric consequences", Combinatorica 1:4 (1981), 357-368.
15. P. Erdos, "Graph theory and probability", Canad. J. Math. 11 (1959), 34-38.
16. P. Erdos, "Unsolved problems", Congressus numerantium, vol. 15, Winnipeg 1976, pp. 678-696.
17. N. Wormald, "A 4-chromatic graph with a special plane drawing", J. Austral. Math. Soc. Ser. A 28:1 (1979), 1-8.
18. R. Hochberg and P. O'Donnell, "Some 4-chromatic unit-distance graphs without small cycles", Geombinatorics 5:4 (1996), 137-141.
19. P. O'Donnell, "Arbitrary girth, 4-chromatic unit distance graphs in the plane. I. Graph description", Geombinatorics 9:3 (2000), 145-152.
20. P. O'Donnell, "Arbitrary girth, 4-chromatic unit distance graphs in the plane. II. Graph embedding", Geombinatorics 9:4 (2000), 180-193.
21. A. M. Raigorodskii, "Borsuk's problem and the chromatic numbers of some metric spaces", Uspekhi Mat. Nauk 56:1 (2001), 107-146.
22. Russian Math. Surveys 56:1 (2001), 103-139.
23. L. A. Szekely, "Erdos on unit distances and the Szemeredi-Trotter theorems", Bolyai Soc. Math. Stud., vol. 11, Springer-Veerlag, Berlin.
24. Bolyai Math. Soc., Budapest 2002, pp. 649-666.
25. A. Soifer, "The chromatic number of the plane: its past, present and future", Mat. Prosveshchenie, vol. 8, 2004, pp. 186-221. (Russian).
26. P. Brass, W. Moser and J. Pach, Research problems in discrete geometry, Springer-Verlag, New York 2005.
27. J. Pach and P. K. Agarwal, Combinatorial geometry, Wiley-Intersci. Ser. Discrete Wiley-Interscience Publ., New York 1995.
28. V. Klee and S. Wagon, Old and new unsolved problems in plane geometry and number theory, Dolciani Math. Exp., vol. 11, Math. Association of America, Washington 1991.
29. A. Soifer, The mathematical coloring book, Springer-Verlag, New York 2009.
30. A. M. Raigorodskii, The linear-algebraic method in combinatoric, Moscow Center for Continuous Mathematical Education, Moscow 2007. (Russian).
31. O. I. Rubanov, "Chromatic numbers of 3-dimensional distance graphs containing no tetrahedra", Mat. Zametki 82:5 (2007), 797-800.
32. Math. Notes 82:5 (2007), 718-721.
33. R. C. Baker, G. Harman and J. Pintz, "The difference between consecutive primes. II", Proc. London Math. Soc. (3) 83: (2001), 532-562. (Pubitemid 33776381)
34. L. Babai and P. Frankl, Linear algebra methods in combinatorics, Part 1, Department of Computer Science, The University of Chicago, Preliminary version 2, 1992.
35. A. M. Raigorodskii, "The problems of Borsuk and Grunbaum on lattice polytopes", Izv. Ross. Akad. Nauk Ser. Mat. 69:3 (2005), 81-108.
36. Izv. Math. 69:3 (2005), 513-537.
37. A. E. Guterman, V. K. Lyubimov, A. M. Raigorodskii and S. A. Ysachev, "The independence numbers of distance graphs with vertices in -1, 0, 1-n: estimates, conjectures and applications to the Nelson-Erdos-Hadwiger and Borsuk problems", Itogi Nauki Tekhn. Sovr. Mat. 65 (2009), 82-100. (Russian).
38. A. M. Raigorodskii and I. M. Shitova, "Chromatic numbers of real and rational spaces with real or rational forbidden distances", Mat. Sb. 199:4 (2008), 107-142.
39. Sb. Math. 199:4 (2008), 579-612.
40. E. S. Gorskaya, I. M. Mitricheva, V.Y. Protasov and A. M. Raigorodskii, "Estimating the chromatic numbers of Euclidean space by convex minimization methods", Mat. Sb. 200:6 (2009), 3-22.
41. Sb. Math. 200:6 (2009), 783-801.
42. F. J. MacWilliams and N. J. A. Sloane, The theory of error-correcting codes, I, II, North-Holland, Amsterdam-New York-Oxford 1977.
43. M. Hall, Combinatorial theory, Blaisdell Publ., Waltham, MA-Toronto-London 1967.
44. N. Alon and J. H. Spencer, The probabilistic method, Wiley-Interscience Ser. Discrete Math. Optim., Wiley, New York 2000.
45. B. Bollobas, Random graphs, Cambridge vol. 73, Cambridge Univ. Press, Cambridge 2001.
46. A. M. Raigorodskii, Probability and algebra in combinatorial theory, Moscow Center for Continuous Mathematical Education, Moscow 2008. (Russian).
47. A. M. Raigorodskii and O. I. Rubanov, "On the clique and the chromatic numbers of high-dimensional distance graphs", Number theory and applications, Hindustan Book Agency, New Delhi 2009, pp. 149-155.
48. A. M. Raigorodskii and O. I. Rubanov, "Distance graphs with large chromatic number and without large cliques", Mat. Zametki 87:3 (2010), 417-428.
49. Math. Notes 87:3 (2010), 392-402.
50. B. V. Gnedenko, A course of probability theory, 3rd ed., Fizmatlit, Moscow 1961.
51. B. W. Gnedenko, Theory of probability, Gordon and Breach, Newark, NJ 1997.
52. A. M. Raigorodskii and M. I. Absalyamova, "A lower bound for the chromatic number of the space Rn with k forbidden distances and the L1 metric", Chebyshevskii Sb., 2006, no. 4, 105-112. (Russian).