{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:05:02Z","timestamp":1787321102845,"version":"build-2736575974"},"reference-count":3,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"name":"National Research, Development and Innovation Office","award":["K116769"],"award-info":[{"award-number":["K116769"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Gy\u00e1rf\u00e1s, Gy\u00f6ri, and Simonovits [J. Comb., 7 (2016), pp. 205--216] proved that if a $3$-uniform hypergraph with $n$ vertices has no linear cycles, then its independence number $\\alpha \\ge \\frac{2n} {5}$. The hypergraph consisting of vertex disjoint copies of a complete hypergraph $K_5^3$ on five vertices shows that equality can hold. They asked whether this bound can be improved if we exclude $K_5^3$ as a subhypergraph and whether such a hypergraph is $2$-colorable. In this paper, we answer these questions affirmatively. Namely, we prove that if a $3$-uniform linear-cycle-free hypergraph doesn't contain $K_5^3$ as a subhypergraph, then it is $2$-colorable. This result clearly implies that its independence number $\\alpha \\ge \\lceil \\frac{n}{2} \\rceil$. We show that this bound is sharp. Gy\u00e1rf\u00e1s, Gy\u00f6ri, and Simonovits also proved that a linear-cycle-free $3$-uniform hypergraph contains a vertex of strong degree at most 2. In this context, we show that a linear-cycle-free $3$-uniform hypergraph has a vertex of degree at most $n-2$ when $n \\ge 10$.<\/jats:p>","DOI":"10.1137\/16m1102367","type":"journal-article","created":{"date-parts":[[2018,4,26]],"date-time":"2018-04-26T14:09:31Z","timestamp":1524751771000},"page":"933-950","source":"Crossref","is-referenced-by-count":1,"title":["3-Uniform Hypergraphs and Linear Cycles"],"prefix":"10.1137","volume":"32","author":[{"given":"Beka","family":"Ergemlidze","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ervin","family":"Gy\u00f6ri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abhishek","family":"Methuku","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,4,26]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018630111976"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(87)90016-1"},{"key":"atypb3","first-page":"205","volume":"7","author":"Gya\u0301rfa\u0301s A.","year":"2016","journal-title":"J. Comb."}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/16M1102367","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:05:34Z","timestamp":1787317534000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/16M1102367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":3,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/16M1102367"],"URL":"https:\/\/doi.org\/10.1137\/16m1102367","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}