Odd cycles and \(\Theta\)-cycles in hypergraphs (Q2433709)

A \(\Theta\)-cycle in a hypergraph \(H = (V,E)\) is a cycle plus an edge that contains three base points of the cycle. It is shown that if a hypergraph has no \(\Theta\)-cycle and all edges have at least three vertices, then \(\sum_{e \in E} (| e| - 1) \leq 2 | V| - 2\). In consequence, \(3\)-uniform hypergraphs having \(n\) vertices and \(n\) edges do have \(\Theta\)-cycles. For \(3\)-uniform linear hypergraphs, superiour bounds on the number of edges forcing a \(\Theta\)--cycle or an odd cycle are given.