Dismantling sparse random graphs

Combinatorics Probability and Computing

Volumn 17, Issue 2, 2008, Pages 259-264

  Janson, Svante ^a   Thomason, Andrew ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

NUMBER THEORY; RANDOM VARIABLES;

RANDOM GRAPHS;

GRAPH THEORY;

EID: 39449120734     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548307008802     Document Type: Article

References (21)

1. Bau, S., Wormald, N. C. and Zhou, S. (2002) Decycling numbers of random regular graphs. Random Struct. Alg. 21397-413.
2. Bollobás, B. (2001) Random Graphs, 2nd edn, Cambridge University Press, Cambridge.
3. Bollobás, B., Janson, S. and Riordan, O. (2007) The phase transition in inhomogeneous random graphs. Random Struct. Alg. 31 3-122.
4. Britton, T., Janson, S. and Martin-Löf, A. (2007) Graphs with specified degree distributions, simple epidemics and local vaccination strategies. Preprint: arXiv:math/0702021v1
5. Edwards, K. and Farr, G. (2001) Fragmentability of graphs. J. Combin. Theory Ser. B 82 30-37.
6. Edwards, K. and Farr, G. (2003) Research problems from the 18th British Combinatorial Conference. Discrete Math. 266 441-451.
7. Edwards, K. and Farr, G. (2007) Planarization and fragmentability of some classes of graphs. Discrete Math., to appear.
8. Edwards, K. and McDiarmid, C. (1994) New upper bounds on harmonious colorings. J. Graph Theory 18 257-267.
9. Erdos, P. and Rényi, A. (1960) On the evolution of random, graphs. Publ. Math. Inst. Hungar. Acad. Sci. 5 17-61.
10. Frieze, A. M. (1990) On the independence number of random graphs. Discrete Math. 81 171-175.
11. Frieze, A. M. and Luczak, T. (1992) On the independence and chromatic numbers of random regular graphs. J. Combin. Theory Ser. B 54 123-132.
12. Garmanik, D., Nowicki, T. and Swirszcz, G. (2006) Maximum, weight independent sets and matchings in sparse random graphs: Exact results using the local weak convergence method. Random Struct. Alg. 28 76-106.
13. Haxell, P., Pikhurko, O. and Thomason, A. Maximum acyclic and fragmented sets in regular graphs. J. Graph Theory, to appear.
14. Hoppen, C. and Wormald, N. C. (2007) Induced forests in regular graphs with large girth. Preprint: arXiv:0709.3126v1
15. Janson, S. and Luczak, M. (2007) A simple solution to the k-core problem.. Random Struct. Alg. 30 50-62.
16. Janson, S., Luczak, T. and Ruciński, A. (2000) Random Graphs, Wiley, New York.
17. Karp, R. M. (1972) Reducibility among combinatorial problems. In Complexity of Computer Computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, 1972), Plenum, New York, pp. 85-103.
18. Lipton, R. J. and Tarjan, R. E. (1979) A separator theorem for planar graphs. SIAM J. Appl. Math. 36 177-189.
19. Luczak, M. and McDiarmid, C. (2001) Bisecting sparse random graphs. Random Struct. Alg. 1831-38.
20. McDiarmid, C. (2002) Concentration for independent permutations. Combin. Prob. Comput. 11 163-178.
21. Talagrand, M. (1995) Concentration of measure and isoperimetric inequalities in product spaces. Inst. Hautes Études Sci. Publ. Math. 81 73-205.