Random regular graphs of non-constant degree: Independence and chromatic number

Combinatorics Probability and Computing

Volumn 11, Issue 4, 2002, Pages 323-341

  Cooper, Colin ^a   Frieze, Alan ^b   Reed, Bruce ^c   Riordan, Oliver ^d  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c CNRS   (France)

^d TRINITY COLLEGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; GRAPH THEORY; NUMBER THEORY; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SET THEORY;

CHROMATIC NUMBER; INDEPENDENCE NUMBER; RANDOM REGULAR GRAPHS;

THEOREM PROVING;

EID: 0035993132     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548302005254     Document Type: Article

References (15)

1. Bender, E. A. and Canfield, E. R. (1978) The asymptotic number of labelled graphs with given degree sequences. J. Combin. Theory Ser. A 296-307.
2. Bollobá, B. (1980) A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Europ. J. Combin. 311-316.
3. Cooper, C. D., Frieze, A. M. and Reed, B. A. (2002) Random regular graphs of non-constant degree: Connectivity and Hamiltonicity. Combin. Probab. Comput. 11 249-261.
4. Frieze, A. M. (1988) Random regular graphs of non-constant degree. Technical report, Department of Mathematical Sciences, Carnegie Mellon University.
5. Frieze, A. M. (1990) On the independence number of a random graph. Discrete Math. 81 171-176.
6. 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.
7. Hoeffding, W. (1963) Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58 13-30.
8. Janson, S., Luczak, T. and Ruciński, A. (2000) Random Graphs, Wiley.
9. Krivelevich, M., Sudakov, B., Vu, V. and Wormald, N. C. (2001) Random regular graphs of high degree. 18 346-362. Random Struct. Alg.
10. Kučera, L. (1987) Canonical labeling of regular graphs in linear expected time. In Proc. 28th Annual IEEE Symposium on Foundations of Computer Science, pp. 271-279.
11. Luczak, T. (1991) The chromatic number of random graphs. Combinatorica 11 45-54.
12. McKay, B. D. (1985) Asymptotics for symmetric 0-1 matrices with prescribed row sums. Ars Combinatoria 19A 15-25.
13. 1/2). Combinatorica 11 369-382.
14. McKay, B. D. and Wormald, N. C. (1990) Asymptotic enumeration by degree sequence of graphs of high degree. Europ. J. Combin. 11 565-580.
15. 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 Notes, Cambridge University Press, pp. 239-298.