On the chromatic number of random graphs with a fixed degree sequence

Combinatorics Probability and Computing

Volumn 16, Issue 5, 2007, Pages 733-746

  Frieze, Alan ^a   Krivelevich, Michael ^b   Smyth, Cliff ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING; NUMBER THEORY; NUMERICAL METHODS; PROBLEM SOLVING; RANDOM PROCESSES;

CHROMATIC NUMBERS; FIXED DEGREE SEQUENCES; POWER LAW; RANDOM GRAPHS;

GRAPH THEORY;

EID: 35348899666     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548306008388     Document Type: Article

References (18)

1. Achlioptas, D. and Moore, C. (2004) The chromatic number of random regular graphs. In Proc. RANDOM 2004, pp. 219-228.
2. Achlioptas, D. and Naor, A. (2005) The two possible values of the chromatic number of a random graph. Ann. of Math. 62 1335-1351.
3. Aiello, W., Chung, F. and Lu, L. (2001) A random graph model for power law graphs. Experiment. Math. 10 53-66.
4. Alon, N., Krivelevich, M. and Sudakov, B. (1999) Coloring graphs with sparse neighborhoods. J. Combin. Theory Ser. B 77 73-82.
5. Bender, E. A. and Canfield, E. R. (1978) The asymptotic number of labelled graphs with given degree sequences. J. Combin. Theory Ser. A 24 296-307.
6. Bollobás, B. (1980) A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Europ. J. Combin. 1 311-316.
7. Bollobás, B. (1988) The chromatic number of random graphs. Combinatorica 8 49-55.
8. Cooper, C. and Frieze, A. M. (2004) The size of the largest strongly connected, component of a random digraph with a given degree sequence. Combin. Probab. Comput. 13 319-338.
9. Cooper, C., Frieze, A. M., Reed, B. A. and Riordan, O. (2002) Random regular graphs of nonconstant degree: Independence and chromatic number. Combin. Probab. Comput. 11 323-342.
10. 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.
11. Frieze, A. M. and Pittel, B. G.(2004) Perfect matchings in random graphs with prescribed minimal degree. In Mathematics and Computer Science III (M. Drmota, P. Flajolet, D. Gardy and B. Gittenberger, eds), Trends in Mathematics, Birkhäuser, Basel, pp. 95-132.
12. Luczak, T. (1991) The chromatic number of random graphs. Combinatorica 11 45-54.
13. McKay, B. D. and Wormald, N. C. (1990) Asymptotic enumeration by degree sequence of graphs of high degree. Europ. J. Combin. 11 565-580.
14. McKay, B. D. and Wormald, N. C. (1990) Uniform generation of random regular graphs of moderate degree. J. Algorithms 11 52-67.
15. 1/2). Combinatorica 11 369-382.
16. Molloy, M. and Reed, B. A. (1995) A critical point for random graphs with a given degree sequence. Random Struct. Alg. 6 161-180.
17. Molloy, M. and Reed, B. A. (1998) The size of the largest component of a random graph on a fixed degree sequence. Combin. Probab. Comput. 7 295-306.
18. Wormald, N. C. (1999) Models of random regular graphs. In Surveys in Combinatorics: Proc. 1999 British Combinatorial Conference (J. D. Lamb and D. A. Preece, eds), Vol. 267 of London Mathematical Society Lecture Note Series, Cambridge University Press, Cambridge, pp. 239-298.