Partitioning infinite hypergraphs into few monochromatic Berge-paths

Bustamante, Sebastián; Corsten, Jan; and Frankl, Nóra (2020) Partitioning infinite hypergraphs into few monochromatic Berge-paths Graphs and Combinatorics, 36 (3). 437 - 444. ISSN 0911-0119
Copy

Extending a result of Rado to hypergraphs, we prove that for all s, k, t∈ N with k≥ t≥ 2 , 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.
Item Type Article
Keywords graph partitioning,monochromatic cycle partitioning,infinite graphs,Berge-paths
Departments Mathematics
DOI 10.1007/s00373-019-02113-3
Date Deposited 06 Jan 2020 09:57
URI https://researchonline.lse.ac.uk/id/eprint/102991

Explore Further

picture_as_pdf
picture_as_pdf
subject
Published Version
Available under Creative Commons: Attribution 4.0
Download

Atom BibTeX OpenURL ContextObject in Span OpenURL ContextObject Dublin Core MPEG-21 DIDL Data Cite XML EndNote HTML Citation METS MODS RIOXX2 XML Reference Manager Refer ASCII Citation
Export

Downloads