The Ramsey number for hypergraph cycles. I.
From MaRDI portal
Publication:817613
DOI10.1016/j.jcta.2005.02.005zbMath1089.05053OpenAlexW2139746216MaRDI QIDQ817613
Andrzej Ruciński, Vojtěch Rödl, Tomasz Łuczak, Miklós Simmonovits, Penny E. Haxell, Jozef Skokan, Yue Jian Peng
Publication date: 16 March 2006
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2005.02.005
Related Items
A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles, Large monochromatic components and long monochromatic cycles in random hypergraphs, Hamiltonian paths and cycles in some 4-uniform hypergraphs, Monochromatic Hamiltonian Berge-cycles in colored hypergraphs, Ramsey numbers of 4-uniform loose cycles, Ramsey numbers of uniform loose paths and cycles, Long monochromatic Berge cycles in colored 4-uniform hypergraphs, Ramsey numbers of 3-uniform loose paths and loose cycles, Improved monochromatic loose cycle partitions in hypergraphs, Diagonal Ramsey Numbers of Loose Cycles in Uniform Hypergraphs, The Ramsey number of generalized loose paths in hypergraphs, Large monochromatic components in 3‐edge‐colored Steiner triple systems, Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth, Hamilton saturated hypergraphs of essentially minimum size, Regular uniform hypergraphs, \(s\)-cycles, \(s\)-paths and their largest Laplacian H-eigenvalues, Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs, \(k\)-centric Turán numbers and multi-color Ramsey numbers for a loose 3-uniform path of length 3, Monochromatic matchings in the shadow graph of almost complete hypergraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, The Ramsey Number for 3-Uniform Tight Hypergraph Cycles, An approximate Dirac-type theorem for \(k\)-uniform hypergraphs, Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs, 3-uniform hypergraphs of bounded degree have linear Ramsey numbers, Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs, Short paths in quasi-random triple systems with sparse underlying graphs, Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs, Ramsey numbers of Berge-hypergraphs and related structures, The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle, On the Ramsey number of sparse 3-graphs, Ramsey numbers of sparse hypergraphs, Ramsey numbers of 5-uniform loose cycles, The Ramsey number of 3-uniform loose path versus star, Ramsey numbers for bipartite graphs with small bandwidth, The Ramsey number for hypergraph cycles. I.
Cites Work
- Unnamed Item
- The Ramsey number for hypergraph cycles. I.
- The Ramsey number for a triple of long even cycles
- The uniformity lemma for hypergraphs
- All Ramsey numbers for cycles in graphs
- \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
- Ramsey numbers for cycles in graphs
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- Regularity lemmas for hypergraphs and quasi-randomness
- Excluding Induced Subgraphs III: A General Asymptotic
- Extremal problems on set systems
