Monochromatic path and cycle partitions in hypergraphs

zbMath1266.05091MaRDI QIDQ1953397

Gábor N. Sárközy, András Gyárfás

Publication date: 7 June 2013

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

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i1p18

zbMATH Keywords

Ramsey theorymonochromatic pathsmonochromatic cyclesedge colored hypergraphsmonochromatic Berge-pathsuniform complete hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Generalized Ramsey theory (05C55)

Related Items (17)

Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Monochromatic cycle power partitions ⋮ Decompositions of edge-colored infinite complete graphs into monochromatic paths ⋮ Monochromatic loose path partitions in \(k\)-uniform hypergraphs ⋮ Partitioning infinite hypergraphs into few monochromatic Berge-paths ⋮ Cover \(k\)-uniform hypergraphs by monochromatic loose paths ⋮ Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II ⋮ Improved monochromatic loose cycle partitions in hypergraphs ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Monochromatic loose-cycle partitions in hypergraphs ⋮ Monochromatic paths in 2-edge-coloured graphs and hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Monochromatic bounded degree subgraph partitions ⋮ Ramsey Problems for Berge Hypergraphs ⋮ Monochromatic square-cycle and square-path partitions ⋮ Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles ⋮ Towards Lehel's conjecture for 4-uniform tight cycles

This page was built for publication: Monochromatic path and cycle partitions in hypergraphs