On graphs without cycles of length 0 modulo 4
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\).
- A unified proof of conjectures on cycle lengths in graphs
- Cycle lengths and minimum degree of graphs
- Cycles Modulo k
- Cycles of length 0 modulo 4 in graphs
- Cycles of length 1 modulo 3 in graph
- Cycles of length 2 modulo 3 in graphs
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- Extremal problems for cycles in graphs
- Graph decomposition with applications to subdivisions and path systems modulo k
- Graphs with a cycle of length divisible by three
- Graphs without four-cycles
- scientific article; zbMATH DE number 3547317 (Why is no real title available?)
- scientific article; zbMATH DE number 867680 (Why is no real title available?)
- scientific article; zbMATH DE number 898011 (Why is no real title available?)
- On arithmetic progressions of cycle lengths in graphs
- On two cycles of consecutive even lengths
- The extremal function for cycles of length \(\ell\) mod \(k\)
This page was built for publication: On graphs without cycles of length 0 modulo 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862425)
