{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:58Z","timestamp":1753893838565,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>In this paper we study the monochromatic loose-cycle partition\u00a0problem for non-complete hypergraphs. Our main result is that in any $r$-coloring of a $k$-uniform hypergraph with independence number\u00a0$\\alpha$ there is a partition of the vertex set into monochromatic\u00a0loose cycles such that their number depends only on $r$, $k$ and\u00a0$\\alpha$. We also give an extension of the following result of P\u00f3sa to hypergraphs: the vertex set of every graph $G$ can be partitioned into at most $\\alpha(G)$ cycles, edges and vertices.<\/jats:p>","DOI":"10.37236\/4062","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T01:04:22Z","timestamp":1578704662000},"source":"Crossref","is-referenced-by-count":5,"title":["Monochromatic Loose-Cycle Partitions in Hypergraphs"],"prefix":"10.37236","volume":"21","author":[{"given":"Andr\u00e1s","family":"Gy\u00e1rf\u00e1s","sequence":"first","affiliation":[]},{"given":"G\u00e1bor","family":"S\u00e1rk\u00f6zy","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2014,5,22]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v21i2p36\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v21i2p36\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T10:59:01Z","timestamp":1579258741000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v21i2p36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,22]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2014,3,31]]}},"URL":"https:\/\/doi.org\/10.37236\/4062","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2014,5,22]]},"article-number":"P2.36"}}