Partitioning infinite hypergraphs into few monochromatic Berge-paths
From MaRDI portal
Publication:2175777
DOI10.1007/s00373-019-02113-3zbMath1439.05185arXiv1905.05100OpenAlexW3000466327WikidataQ126319495 ScholiaQ126319495MaRDI QIDQ2175777
Jan Corsten, Nóra Frankl, Sebastián Bustamante
Publication date: 30 April 2020
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.05100
Hypergraphs (05C65) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Infinite graphs (05C63)
Related Items (1)
Cites Work
- Improved monochromatic loose cycle partitions in hypergraphs
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Monochromatic loose-cycle partitions in hypergraphs
- Long monochromatic Berge cycles in colored 4-uniform hypergraphs
- Monochromatic matchings in the shadow graph of almost complete hypergraphs
- An improved bound for the monochromatic cycle partition number
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
- Vertex coverings by monochromatic cycles and trees
- Monochromatic path and cycle partitions in hypergraphs
- Monochromatic Hamiltonian Berge-cycles in colored hypergraphs
- Decompositions of edge-colored infinite complete graphs into monochromatic paths
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
- Monochromatic Paths in Graphs
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- Ramsey Problems for Berge Hypergraphs
- Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles
- A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles
This page was built for publication: Partitioning infinite hypergraphs into few monochromatic Berge-paths
