On graphs without cycles of length 0 modulo 4 (Q6862425)

The authors of this paper consider the task of finding the maximum number of edges in a graph containing no cycle of length \(0 \pmod 4\). The authors are motivated by the work of \textit{B. Bollobas} [Bull. Lond. Math. Soc. 9, 97--98 (1977; Zbl 0348.05104)] who settled the conjecture raised by Burr and Erdős that: All extremal \(n\)-vertex graphs not containing cycles of length \(\ell \pmod k\), where \(k\mathbb{Z} +\ell\) contains an even number, \(k\), \(\ell\) are natural numbers, could contain at most a linear number of edges. The exact values of the maximum number of edges are determined for only a few values of \(\ell\) and \(k\). The authors make an incremental step forward by finding the actual number of maximum edges in an \(n\) vertex graph containing no cycle of length \(0 \pmod 4\).