Independence numbers and chromatic numbers of the random subgraphs of some distance graphs

Sbornik Mathematics

Volumn 206, Issue 10, 2015, Pages 1340-1374

  Bogolubsky, L I ^a   Gusev, A S ^a   Pyaderkin, M M ^a   Raigorodskii, A M ^a,b,c  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b MOSCOW INSTITUTE OF PHYSICS AND TECHNOLOGY   (Russian Federation)

^c BURYAT STATE UNIVERSITY   (Russian Federation)

Author keywords

Chromatic number; Distance graph; Independence number; Random graph

Indexed keywords

EID: 84953283845     PISSN: 10645616     EISSN: 14684802     Source Type: Journal    
DOI: 10.1070/SM2015v206n10ABEH004498     Document Type: Article

References (66)

1. P. Brass, W. Moser and J. Pach, Research problems in discrete geometry, Springer, New York 2005, xii+499 pp.
2. Z. Nagy, "A certain constructive estimate of the Ramsey number", Mat. Lapok 23(1972) (1974), 301-302.
3. R. L. Graham, B. L. Rothschild and J. H. Spencer, Ramsey theory, 2nd ed., Wiley-Intersci. Ser. Discrete Math. Optim., John Wiley & Sons, Inc., New York 1990, xii+196 pp.
4. A. M. Raigorodskii, Probability and algebra in combinatorics, 3rd ed., Moscow Center for Continuous Mathematical Education, Moscow 2015, 48 pp. (Russian)
5. D. G. Larman and C. A. Rogers, "The realization of distances within sets in Euclidean space", Mathematika 19:1 (1972), 1-24.
6. J. Balogh, A. Kostochka and A. Raigorodskii, "Coloring some finite sets in Rn", Discuss. Math. Graph Theory 33:1 (2013), 25-31.
7. A. M. Raigorodskii, "Borsuks problem and the chromatic numbers of some metric spaces", Uspekhi Mat. Nauk 56:1(337) (2001), 107-146;
8. English transl. in Russian Math. Surveys 56:1 (2001), 103-139.
9. A. M. Raigorodskii, "Coloring distance graphs and graphs of diameters", Thirty essays on geometric graph theory, Springer, New York 2013, pp. 429-460.
10. A. M. Raigorodskii, Linear-algebraic method in combinatorics, Moscow Center for Continuous Mathematical Education, Moscow 2015, 136 pp. (Russian)
11. P. K. Agarwal and J. Pach, Combinatorial geometry, Wiley-Intersci. Ser. Discrete Math. Optim., John Wiley & Sons, Inc., New York 1995, xiv+354 pp.
12. L. A. Szekely, "Erdõs on unit distances and the Szemeredi-Trotter theorems", Paul Erdõs and his mathematics, vol. II (Budapest 1999
13. Bolyai Soc. Math. Stud., vol. 11, Janos Bolyai Math. Soc., Budapest 2002, pp. 649-666.
14. A. Soifer, The mathematical coloring book. Mathematics of coloring and the colorful life of its creators, Springer, New York 2009, xxx+607 pp.
15. V. Klee and S. Wagon, Old and new unsolved problems in plane geometry and number theory, Dolciani Math. Exp., vol. 11, Math. Assoc. America, Washington, DC 1991, xvi+333 pp.
16. P. Erdos and A. Renyi, "On random graphs. I", Publ. Math. Debrecen 6 (1959), 290-297.
17. P. Erdõs and A. Renyi, "On the evolution of random graphs", Magyar Tud. Akad. Mat. Kutato Int. Kõzl. 5 (1960), 17-61.
18. P. Erdõs and A. Renyi, "On the evolution of random graphs", Bull. Inst. Internat. Statist. 38:4 (1961), 343-347.
19. A. M. Raigorodskii, Models of random graphs, Moscow Center for Continuous Mathematical Education, Moscow 2011, 136 pp. (Russian)
20. B. Bollobas, Random graphs, 2nd ed., Cambridge Stud. Adv. Math., vol. 73, Cambridge Univ. Press, Cambridge 2001, xviii+498 pp.
21. V. F. Kolchin, Random graphs, 2nd ed., Fizmatlit, Moscow 2004, 256 pp.;
22. English transl. of 1st ed., Encyclopedia Math. Appl., vol. 53, Cambridge Univ. Press, Cambridge 1999, xii+252 pp.
23. S. Janson, T. Luczak and A. Rucinski, Random graphs, Wiley-Intersci. Ser. Discrete Math. Optim., Wiley-Interscience, New York 2000, xii+333 pp.
24. B. Bollobas, "The chromatic number of random graphs", Combinatorica 8:1 (1988), 49-55.
25. T. Luczak, "The chromatic number of random graphs", Combinatorica 11:1 (1991), 45-54.
26. K. Weber, "On the independence number of random subgraphs of the n-cube", Random graphs 85 (Poznan 1985
27. North-Holland Math. Stud., vol. 144, Ann. Discrete Math., 33, North-Holland, Amsterdam 1987, pp. 333-337.
28. M. Krivelevich and B. Sudakov, "Pseudo-random graphs", More sets, graphs and numbers, Bolyai Soc. Math. Stud., vol. 15, Springer, Berlin 2006, pp. 199-262.
29. F. Harary, Graph theory, Addison-Wesley Publishing Co., Reading, Mass.-Menlo Park, Calif.-London 1969, ix+274 pp.
30. N. Alon and J. H. Spencer, The probabilistic method, 2nd ed., Wiley-Intersci. Ser. Discrete Math. Optim., Wiley-Interscience [John Wiley & Sons], New York 2000, xviii+301 pp.
31. D. G. Larman, "A note on the realization of distances within sets in Euclidean space", Comment. Math. Helv. 53:4 (1978), 529-535.
32. P. Frankl and R. M. Wilson, "Intersection theorems with geometric consequences", Combinatorica 1:4 (1981), 357-368.
33. V. G. Boltyanski, H. Martini and P. S. Soltan, Excursions into combinatorial geometry, Universitext, Springer-Verlag, Berlin 1997, xiv+418 pp.
34. A. M. Raigorodskii, "Three lectures on the Borsuk partition problem", Surveys in contemporary mathematics, London Math. Soc. Lecture Note Ser., vol. 347, Cambridge Univ. Press, Cambridge 2008, pp. 202-247.
35. A. M. Raigorodskii, "Around Borsuks hypothesis", Geometry and mechanics, Sovrem. Mat. Fundam. Napravl., vol. 23, Rossiiskii Universitet Druzhby Narodov, Moscow 2007, pp. 147-164;
36. English transl. in J. Math. Sci. (N. Y.) 154:4 (2008), 604-623.
37. A. M. Raigorodskii, "The problems of Borsuk and Grunbaum on lattice polytopes", Izv. Ross. Akad. Nauk Ser. Mat. 69:3 (2005), 81-108;
38. English transl. in Izv. Math. 69:3 (2005), 513-537.
39. A. M. Raigorodskii, "The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs", Mat. Sb. 196:1 (2005), 123-156;
40. English transl. in Sb. Math. 196:1 (2005), 115-146.
41. A. E. Guterman, V. K. Lyubimov, A. M. Raigorodskii and S. A. Usachev, "On independence numbers of distance graphs with vertices in {-1, 0, 1}n: Estimates, conjectures, and applications to the Nelson-Erdõs-Hadwiger problem and the Borsuk problem", Sovrem. Mat. Prilozh., vol. 65, VINITI, Moscow 2009, pp. 82-100;
42. English transl. in J. Math. Sci. (N. Y.) 165:6 (2010), 689-709.
43. A. M. Raigorodskii, "On the chromatic numbers of spheres in Rn", Combinatorica 32:1 (2012), 111-123.
44. A. Raigorodskii and A. Kupavskii, "Counterexamples to Borsuks conjecture on spheres of small radii", Moscow J. Combin. Number Theory 2:4 (2012), 27-48.
45. E. I. Ponomarenko and A. M. Raigorodskii, "An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges", Dokl. Ross. Akad. Nauk 454:3 (2014), 268-269;
46. English transl. in Dokl. Math. 89:1 (2014), 59-60.
47. E. I. Ponomarenko and A. M. Raigorodskii, "New estimates in the problem of the number of edges in a hypergraph with forbidden intersections", Problemy Peredachi Informatsii 49:4 (2013), 98-104;
48. English transl. in Problems Inform. Transmission 49:4 (2013), 384-390.
49. M. Hall, Jr., Combinatorial theory, Blaisdell Publishing Co., Waltham, Mass.-Toronto, Ont.-London 1967, x+310 pp.
50. F. J. MacWilliams and N. J. A. Sloane, The theory of error-correcting codes, Parts I, II, North-Holland Math. Library, vol. 16, North-Holland Publishing Co., Amsterdam-New York-Oxford 1977.
51. V. Rõdl, "On a packing and covering problem", European J. Combin. 6:1 (1985), 69-78.
52. J. Matousek, Using the Borsuk-Ulam theorem, Lectures on topological methods in combinatorics and geometry, Universitext, Springer, Berlin 2003, xii+196 pp.
53. P. Erdõs, Chao Ko and R. Rado, "Intersection theorems for systems of finite sets", Quart. J. Math. Oxford Ser. (2) 12:1 (1961), 313-320.
54. M. Deza and P. Frankl, "Erdõs-Ko-Rado theorem-22 years later", SIAM J. Algebraic Discrete Methods 4:4 (1983), 419-431.
55. B. Bollobas and P. Erdõs, "Cliques in random graphs", Math. Proc. Cambridge Philos. Soc. 80:3 (1976), 419-427.
56. Zs. Baranyai, "On the factorization of the complete uniform hypergraph", Infinite and finite sets, vol. I, Colloq., dedicated to P. Erdõs on his 60th birthday (Keszthely 1973
57. Colloq. Math. Soc. Janos Bolyai, vol. 10, North-Holland, Amsterdam 1973, pp. 91-108.
58. A. M. Raigorodskii, "The Borsuk problem for (0, 1)-polyhedra and cross polytopes", Dokl. Ross. Akad. Nauk 371:5 (2000), 600-603;
59. English transl. in Dokl. Math. 61 (2000), 256-259.
60. A. M. Raigorodskii, "Borsuks problem for (0, 1)-polytopes and cross-polytopes", Dokl. Ross. Akad. Nauk 384:5 (2002), 593-597;
61. English transl. in Dokl. Math. 65:3 (2002), 413-416.
62. A. M. Raigorodskii, "The problem of Borsuk, Hadwiger, and Grunbaum for some classes of polytopes and graphs", Dokl. Ross. Akad. Nauk 388:6 (2003), 738-742;
63. English transl. in Dokl. Math. 67:1 (2003), 85-89.
64. K. A. Mikhailov and A. M. Raigorodskii, "On the Ramsey numbers for complete distance graphs with vertices in {0, 1}n", Mat. Sb. 200:12 (2009), 63-80;
65. English transl. in Sb. Math. 200:12 (2009), 1789-1806.
66. P. Erdõs and G. Szekeres, "A combinatorial problem in geometry", Compositio Math. 2 (1935), 463-470.