Author:
Bollobás Béla,Nikiforov Vladimir
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. B. Bollobás, Modern Graph Theory, Graduate Texts in Mathematics, Vol. 184, Springer, New York, 1998, xiv+394pp.
2. B. Bollobás, Random Graphs, Cambridge Studies in Advanced Mathematics, 2nd Edition, Vol. 73, Cambridge University Press, Cambridge, 2001, xviii+498pp.
3. An extremal problem of graphs with diameter 2;Bollobás;Math. Mag.,1975
4. On character sums and primitive roots;Burgess;Proc. London Math. Soc.,1962
5. F. Chung, Constructing random-like graphs, Probabilistic combinatorics and its applications, Proceedings of Symposium Appl. Math., Vol. 44, San Francisco, CA, 1991, American Mathematical Society, Providence, RI, 1991, pp. 21–55.
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献