The chromatic number of random graphs-Reference-Cited by-同舟云学术

The chromatic number of random graphs

Published:1988-03 Issue:1 Volume:8 Page:49-55
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Bollobás B.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/BF02122551.pdf

Reference19 articles.

1. K. Azuma, Weighted sums of certain dependent random variables,Tôhoku Math. J.,3 (1967), 357–367.

2. B. Bollobás, The evolution of sparse graphs,in Graph Theory and Combinatorics, Proc. Cambridge Combinatorial Conf. in honour of Paul Erdős (B. Bollobás, ed.), Academic Press, London, 1984, 35–37.

3. B. Bollobás,Random Graphs, Academic Press, London, 1985, xvi+447 pp.

4. B. Bollobás andP. Erdős, Cliques in random graphs,Math. Proc. Cambridge Phil. Soc.,80 (1976), 419–427.

5. B.Bollobás and A. G.Thomason, Random graphs of small order,in Random Graphs, Annals of Discr. Math., 1985, 47–97.

Cited by 225 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quantum State Combinatorics;Entropy;2024-09-06

2. The inertia bound is far from tight;Bulletin of the London Mathematical Society;2024-07-30

3. On the Chromatic Number of Random Regular Hypergraphs;SIAM Journal on Discrete Mathematics;2024-04-24

4. On the Concentration of the Chromatic Number of Random Graphs;The Electronic Journal of Combinatorics;2024-02-23

5. Exploring universality of the β−Gaussian ensemble in complex networks via intermediate eigenvalue statistics;Physical Review E;2024-01-16