Embeddings and Ramsey numbers of sparse κ-uniform hypergraphs-Reference-Cited by-同舟云学术

Embeddings and Ramsey numbers of sparse κ-uniform hypergraphs

Published:2009-05 Issue:3 Volume:29 Page:263-297
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Cooley Oliver,Fountoulakis Nikolaos,Kühn Daniela,Osthus Deryk

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/s00493-009-2356-y.pdf

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 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs;Journal of Graph Theory;2023-05-24

2. Tiling multipartite hypergraphs in quasi-random hypergraphs;Journal of Combinatorial Theory, Series B;2023-05

3. Partition Universality for Hypergraphs of Bounded Degeneracy and Degree;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023

4. F$F$‐factors in Quasi‐random Hypergraphs;Journal of the London Mathematical Society;2022-05-02

5. Minimum degree conditions for tight Hamilton cycles;Journal of the London Mathematical Society;2022-04-11