Author:
Cooley Oliver,Fountoulakis Nikolaos,Kühn Daniela,Osthus Deryk
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference29 articles.
1. G. Chen and R. Schelp: Graphs with linearly bounded Ramsey numbers, J. Combinatorial Theory B 57 (1993), 138–149.
2. S. A. Burr and P. Erdős: On the magnitude of generalized Ramsey numbers for graphs; in: Infinite and Finite Sets I., Colloquia Mathematica Societatis János Bolyai vol. 10 (1975), 214–240.
3. V. Chvátal, V. Rödl, E. Szemerédi and W. T. Trotter, Jr.: The Ramsey number of a graph with a bounded maximum degree, J. Combinatorial Theory B 34 (1983), 239–243.
4. D. Conlon, J. Fox and B. Sudakov: Ramsey numbers of sparse hypergraphs, Random Structures & Algorithms, to appear.
5. O. Cooley: Ph.D. thesis, University of Birmingham, in preparation.
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献