Author:
Conlon David,Fox Jacob,Sudakov Benny
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference36 articles.
1. N. Alon, M. Krivelevich and B. Sudakov: Turán numbers of bipartite graphs and related Ramsey-type questions, Combin. Probab. Comput. 12 (2003), 477–494.
2. S. A. Burr and P. Erdős: On the magnitude of generalized Ramsey numbers for graphs, in: Infinite and Finite Sets, Vol. 1 (Keszthely, 1973), Colloq. Math. Soc. János Bolyai, Vol. 10, North-Holland, Amsterdam/London, 1975, 215–240.
3. G. Chen and R. Schelp, Graphs with linearly bounded Ramsey numbers, J. Combin. Theory Ser. B 57 (1993), 138–149.
4. V. Chvátal, V. Rödl, E. Szemerédi and W.T. Trotter Jr.: The Ramsey number of a graph with bounded maximum degree, J. Combin. Theory Ser. B 34 (1983), 239–243.
5. D. Conlon: A new upper bound for diagonal Ramsey numbers, Annals of Math. 170 (2009), 941–960.
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献