Partitioning infinite hypergraphs into few monochromatic Berge-paths

DOI10.1007/S00373-019-02113-3MaRDI QIDQ2175777zbMATH OpenOpenAlexWikidataFDO

Authors Jan Corsten, Nóra Frankl, Sebastián Bustamante

Publication date 30 April 2020

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1905.05100

zbMATH Keywords

Berge-pathsgraph partitioninginfinite graphsmonochromatic cycle partitioning

Mathematics Subject Classification ID

Paths and cycles (05C38) Infinite graphs (05C63) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: Extending a result of Rado to hypergraphs, we prove that for all $s,k,tinmathbbN$ with $kgeqtgeq2$, the vertices of every $r=s(k-t+1)$-edge-coloured countably infinite complete $k$-graph can be partitioned into the cores of at most $s$ monochromatic $t$-tight Berge-paths of different colours. We further describe a construction showing that this result is best possible.

Recommendations

• Decompositions of edge-colored infinite complete graphs into monochromatic paths
• Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II
• Monochromatic path and cycle partitions in hypergraphs
• Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths
• Partitioning edge-colored hypergraphs into few monochromatic tight cycles

Cites work

• A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles
• An improved bound for the monochromatic cycle partition number
• Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
• Decompositions of edge-colored infinite complete graphs into monochromatic paths
• Improved monochromatic loose cycle partitions in hypergraphs
• Long monochromatic Berge cycles in colored 4-uniform hypergraphs
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• Monochromatic Hamiltonian Berge-cycles in colored hypergraphs
• Monochromatic loose-cycle partitions in hypergraphs
• Monochromatic matchings in the shadow graph of almost complete hypergraphs
• Monochromatic path and cycle partitions in hypergraphs
• Monochromatic Paths in Graphs
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• Partitioning edge-colored hypergraphs into few monochromatic tight cycles
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Ramsey problems for Berge hypergraphs
• Vertex coverings by monochromatic cycles and trees

Cited in

(5)

• Infinite monochromatic paths and a theorem of Erdős-Hajnal-Rado
• Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths
• Decompositions of edge-colored infinite complete graphs into monochromatic paths
• Ramsey problems for Berge hypergraphs
• Hypergraphs with Few Berge Paths of Fixed Length between Vertices

This page was built for publication: Partitioning infinite hypergraphs into few monochromatic Berge-paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175777)