Colouring random 4-regular graphs

Combinatorics Probability and Computing

Volumn 16, Issue 2, 2007, Pages 309-344

  Shi, Lingsheng ^a,b   Wormald, Nicholas ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; BOUNDARY CONDITIONS; DIFFERENTIAL EQUATIONS; RANDOM PROCESSES;

CHROMATIC NUMBER; EXPONENTIAL BOUNDS; RANDOM GRAPH;

GRAPH THEORY;

EID: 33847123524     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548306007693     Document Type: Article

References (13)

1. Achlioptas, D. and Moore, C. (2003) Almost all graphs with average degree 4 are 3-colourable. J. Comput. System Sci. 67 441-471.
2. Achlioptas, D. and Naor, A. (2005) The two possible values of the chromatic number of a random graph. Ann. of Math. 162 1335-1351.
3. Bollobás, B. (1985) Random Graphs, Academic Press, New York.
4. Díaz, J., Serna, M. and Wormald, N. C. Computation of the bisection width for random d-regular graphs. Theoret. Comput. Sci., to appear.
5. Janson, S., Łuczak, T. and Ruciński, A. (2000) Random Graphs, Wiley, New York.
6. Molloy, M. and Reed, B. (1998) The size of the giant component of a random graph with a given degree sequence. Combin. Probab. Comput. 1 295-305.
7. Shi, L. and Wormald, N. Colouring random d-regular graphs. Combin. Probab. Comput. (to appear).
8. Spencer, J. and Wormald, N. Birth control for giants. Combinatorica (to appear).
9. Wormald, N. C. (1981) The asymptotic distribution of short cycles in random regular graphs. J. Combin. Theory Ser. B 31 168-182.
10. Wormald, N. C. (1995) Differential equations for random processes and random graphs. Ann. Appl. Probab. 5 1217-1235.
11. Wormald, N. C. (1999) The differential equation method for random graph processes and greedy algorithms. In Lectures on Approximation and Randomized Algorithms (M. Karoński and H. Prömel, eds), PWN, Warsaw, pp. 73-155.
12. Wormald, N. C. (1999) Models of random regular graphs. In Surveys in Combinatorics (J. D. Lamb and D. A. Preece, eds), pp. 239-298.
13. Wormald, N. C. (2004) Random graphs and asymptotics. Section 8.2 in Handbook of Graph Theory (J. L. Gross and J. Yellen, eds), CRC, Boca Raton, pp. 817-836.