Author:
Nikiforov Vladimir,Rousseau Cecil C.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference31 articles.
1. B. Andrásfai, P. Erdős and V. T. Sós: On the connection between chromatic number, maximal clique and minimal degree of a graph, Discrete Math. 8(3) (1974), 205–218.
2. Graduate Texts in Mathematics;B. Bollobás,1998
3. B. Bollobás and V. Nikiforov: Joints in graphs, Discrete Math. 308 (2008), 9–19.
4. S. Brandt: Expanding graphs and Ramsey numbers, available at Bielefeld preprint server, (1996), Preprint No. A 96-24.
5. S. A. Burr, P. Erdős, R. J. Faudree, C. C. Rousseau, R. H. Schelp, R. J. Gould and M. S. Jacobson: Goodness of trees for generalized books, Graphs Combin.
3 (1987), 1–6.
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Ramsey Numbers of Squares of Paths and Cycles;The Electronic Journal of Combinatorics;2024-04-05
2. On a conjecture of Conlon, Fox, and Wigderson;Combinatorics, Probability and Computing;2024-02-16
3. A Note on Ramsey Numbers Involving Large Books;The Electronic Journal of Combinatorics;2024-01-12
4. Ramsey non-goodness involving books;Journal of Combinatorial Theory, Series A;2023-10
5. Ramsey Numbers of Stripes Versus Trees and Unicyclic Graphs;Journal of the Operations Research Society of China;2023-06-15