Author:
Bollobás Béla,Nikiforov Vladimir
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. On the connection between chromatic number, maximal clique and minimum degree of a graph;Andrásfai;Discrete Math.,1974
2. B. Bollobás, Modern Graph Theory, Graduate Texts in Mathematics, vol. 184, Springer, New York, 1998, xiv+394pp.
3. On the number of complete subgraphs and circuits contained in graphs;Erdős;Časopis Pěst. Mat.,1969
4. J. Galambos, I. Simonelli, Bonferroni-type inequalities with applications, Probability and its Applications, Springer, New York, 1996, x+269pp.
5. The Nordhaus–Stewart–Moon–Moser inequality;Khadžiivanov;Serdica,1978
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Ramsey non-goodness involving books;Journal of Combinatorial Theory, Series A;2023-10
2. Short proofs of some extremal results III;Random Structures & Algorithms;2020-08-30
3. A Density Turán Theorem;Journal of Graph Theory;2016-09-20
4. Degree Powers in Graphs: The Erdős–Stone Theorem;Combinatorics, Probability and Computing;2012-02-02
5. Books Versus triangles;Journal of Graph Theory;2011-03-23