Extremal graphs without cycles of length 0 modulo 4
Yanan Hu, Leilei Zhang
Source abstract
In a remarkable recent result, Győri, Li, Salia, Tompkins, Varga and Zhu determined the maximum size in a graph of given order and containing no cycle of length divisible by 4. In this paper, we give a complete characterization of all graphs attaining this maximum. This answers a question posed by Li, Pan and Shi. Very recently, Chu, Park and Ryu established a sharp upper bound on the number of edges in a 2-connected graph containing no cycle of length divisible by 4. We also give a complete characterization of all such graphs attaining this bound.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.