The Ramsey number of diamond-matchings and loose cycles in hypergraphs

zbMath1165.05334MaRDI QIDQ1010861

Gábor N. Sárközy, Endre Szemerédi, András Gyárfás

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1r126.html

zbMATH Keywords

Ramsey numberhypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (17)

Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three ⋮ Large monochromatic components and long monochromatic cycles in random hypergraphs ⋮ Ramsey numbers of 4-uniform loose cycles ⋮ Ramsey numbers of uniform loose paths and cycles ⋮ 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 ⋮ Regular uniform hypergraphs, \(s\)-cycles, \(s\)-paths and their largest Laplacian H-eigenvalues ⋮ Monochromatic partitions in local edge colorings ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Coverings by few monochromatic pieces: a transition between two Ramsey problems ⋮ On multicolor Ramsey numbers for loose \(k\)-paths of length three ⋮ Matchings with few colors in colored complete graphs and hypergraphs ⋮ Ramsey Number of a Connected Triangle Matching ⋮ Ramsey numbers of 5-uniform loose cycles ⋮ The Ramsey number of 3-uniform loose path versus star

This page was built for publication: The Ramsey number of diamond-matchings and loose cycles in hypergraphs