Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs

Doklady Mathematics

Volumn 90, Issue 1, 2014, Pages 462-465

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

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84906860728     PISSN: 10645624     EISSN: None     Source Type: Journal    
DOI: 10.1134/S1064562414050147     Document Type: Article

References (15)

1. P. Brass, W. Moser, and J. Pach, Research Problems in Discrete Geometry (Springer, Berlin, 2005).
2. A. M. Raigorodskii, Russ. Math. Surv. 56(1), 103-139 (2001).
3. A. M. Raigorodskii, in Thirty Essays on Geometric Graph Theory (Springer, Berlin, 2013), pp. 429-460.
4. A. M. Raigorodskii, Combinatorica 32(1), 111-123 (2012).
5. V. G. Boltyanski, H. Vartini, and P. S. Soltan, Excursions into Combinatorial Geometry (Springer, Berlin, 1997).
6. A. M. Raigorodskii, in Surveys in Contemporary Mathematics, London Math. Soc. Lect. Note Ser., No. 347 (Cambridge Univ. Press, London, 2007), pp. 202-248.
7. A. M. Raigorodskii, in Advances of Sciences and Engineering, Ser. Modern Mathematics (VINITI, Moscow, 2007), Vol. 23, pp. 147-164 [in Russian].
8. R. L. Graham, B. L. Rothschild, and J. H. Spencer, Ramsey Theory (Wiley, New York, 1990).
9. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes (North-Holland, New York, 1977; Radio i Svyaz', Moscow, 1979).
10. A. M. Raigorodskii and D. A. Shabanov, Russ. Math. Surv. 66, 933-1002 (2011).
11. B. Bollobás, Random Graphs (Cambridge Univ. Press, Cambridge, 2001).
12. S. Janson, T. uczak, and A. Rucinski, Random Graphs (Wiley, New York, 2000).
13. B. Bollobás, Combinatorica 8, 49-55 (1988).
14. T. uczak, Combinatorica 11, 45-54 (1991).
15. A. M. Raigorodskii and K. A. Mikhailov, Mat. Sb. 200(12), 63-80 (2009).