Author:
Kim Jeong Han,Sudakov Benny,Vu Van
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs;Bollobás;European J. Combin.,1980
2. B. Bollobás, Random graphs, in: Combinatorics, Proceeding Swansea 1981, London Mathematical Society Lecture Note Ser., vol. 52, Cambridge University Press, Cambridge, 1981, pp. 80–102.
3. B. Bollobás, Random Graphs, Cambridge Studies in Advanced Mathematics, second ed., vol. 73, Cambridge University Press, Cambridge, 2001.
4. On the evolution of random graphs;Erdős;Publ. Math. Inst. Hungar. Acad. Sci.,1960
5. An exponential bound for the probability of nonexistence of a specified subgraph in a random graph;Janson,1990
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献