Monochromatic loose-cycle partitions in hypergraphs (Q405239): Difference between revisions

Summary: In this paper we study the monochromatic loose-cycle partition~problem for non-complete hypergraphs. Our main result is that in any \(r\)-coloring of a \(k\)-uniform hypergraph with independence number \(\alpha\) there is a partition of the vertex set into monochromatic~loose cycles such that their number depends only on \(r\), \(k\) and \(\alpha\). We also give an extension of the following result of \textit{L. Pósa} [Publ. Math. Inst. Hung. Acad. Sci., Ser. A 8(1963), 355--361 (1964; Zbl 0133.16702)] to hypergraphs: the vertex set of every graph \(G\) can be partitioned into at most \(\alpha(G)\) cycles, edges and vertices.