Minimal paths and cycles in set systems (Q2372429)

A family of sets \(A_0,\dots,A_{k-1}\) form a minimal \(k\)-cycle if \(A_i\cap A_j \neq \emptyset\) if and only if \((i=j\) or these two are consecutive modulo \(k).\) Denote \(f_r(n,k)\) the maximum size of a family of \(r\)-sets of an \(n\)-element underlying set, not containing minimal \(k\)-cycle. The paper determines new lower and upper bounds for this value. The proofs are based on classical extremal set theoretical results of Paul Erdős and others.