On the independence and chromatic numbers of random regular graphs
暂无分享,去创建一个
[1] Tomasz Luczak. The chromatic number of random graphs , 1991, Comb..
[2] Alan M. Frieze,et al. On the independence number of random graphs , 1990, Discret. Math..
[3] Brendan D. McKay,et al. Uniform Generation of Random Regular Graphs of Moderate Degree , 1990, J. Algorithms.
[4] Colin McDiarmid,et al. Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .
[5] Béla Bollobás,et al. The chromatic number of random graphs , 1988, Comb..
[6] Joel H. Spencer,et al. Sharp concentration of the chromatic number on random graphsGn, p , 1987, Comb..
[7] Béla Bollobás,et al. Random Graphs , 1985 .
[8] Béla Bollobás,et al. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..
[9] Edward A. Bender,et al. The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.
[10] B. Bollobás,et al. Cliques in random graphs , 1976, Mathematical Proceedings of the Cambridge Philosophical Society.
[11] Colin McDiarmid,et al. Topics in Chromatic Graph Theory: Colouring random graphs , 2015 .
[12] Kazuoki Azuma. WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .