On $3$-uniform hypergraphs without linear cycles

Andr\'as Gy\'arf\'as; Ervin Gy\H{o}ri; Mikl\'os Simonovits

arxiv: 1412.7205 · v1 · pith:PEMB5BOJnew · submitted 2014-12-22 · 🧮 math.CO

On 3-uniform hypergraphs without linear cycles

Andr\'as Gy\'arf\'as , Ervin Gy\H{o}ri , Mikl\'os Simonovits This is my paper

classification 🧮 math.CO

keywords hypergraphscycleslinearmustuniformwithoutcontaindegree

0 comments

read the original abstract

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 have independent sets of size at least ${2|V(H)|\over 5}$.

This paper has not been read by Pith yet.

On 3-uniform hypergraphs without linear cycles

discussion (0)