On $3$-uniform hypergraphs without linear cycles

András Gyárfás, Ervin Győri, Miklós Simonovits

We explore properties of $3$-uniform hypergraphs $H$ without linear cycles. Our main results are that these hypergraphs must contain a vertex of strong degree at most two and must…