Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference20 articles.
1. N. Alon and J. Spencer: The Probabilistic Method, 3rd ed., Wiley, New York, 2007.
2. B. Bollobás and V. Nikiforov: Books in graphs, European J. Combin. 26 (2005), 259–270.
3. F. Chung and R. Graham: Erdős on graphs. His legacy of unsolved problems, A K Peters, Ltd., Wellesley, MA, 1998.
4. C.S. Edwards: A lower bound for the largest number of triangles with a common edge, 1977 (unpublished manuscript).
5. P. Erdős: On a theorem of Rademacher-Turán, Illinois J. Math. 6 (1962), 122–127.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献