{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:12Z","timestamp":1753893852998,"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>A linear cycle in a $3$-uniform hypergraph $H$ is a cyclic sequence of hyperedges such that any two consecutive hyperedges intersect in exactly one element and non-consecutive hyperedges are disjoint. Let $\\alpha(H)$ denote the size of a largest independent set of $H$.We show that the vertex set of every $3$-uniform hypergraph $H$ can be covered by at most $\\alpha(H)$ edge-disjoint linear cycles (where we accept a vertex and a hyperedge as a linear cycle), proving a weaker version of a conjecture of\u00a0Gy\u00e1rf\u00e1s and S\u00e1rk\u00f6zy.<\/jats:p>","DOI":"10.37236\/7329","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:24:39Z","timestamp":1578669879000},"source":"Crossref","is-referenced-by-count":0,"title":["A Note on the Linear Cycle Cover Conjecture of Gy\u00e1rf\u00e1s and S\u00e1rk\u00f6zy"],"prefix":"10.37236","volume":"25","author":[{"given":"Beka","family":"Ergemlidze","sequence":"first","affiliation":[]},{"given":"Ervin","family":"Gy\u0151ri","sequence":"additional","affiliation":[]},{"given":"Abhishek","family":"Methuku","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2018,5,25]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i2p29\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i2p29\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:33:29Z","timestamp":1579235609000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i2p29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,25]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,4,13]]}},"URL":"https:\/\/doi.org\/10.37236\/7329","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2018,5,25]]},"article-number":"P2.29"}}