4 papers
Dean's conjecture and cycles modulo k
Yufan Luo, Jie Ma, Ziyuan Zhao
Dean conjectured three decades ago that every graph with minimum degree at least contains a cycle whose length is divisible by . While the conjecture has been verified…
Spectral supersaturation for color-critical graphs
Longfei Fang, Yongtao Li, Huiqiu Lin +1
A graph is color-critical if it contains an edge whose deletion reduces its chromatic number. This class of graphs, including cliques and odd cycles, plays a central role in extrem…
Proof of a conjecture of Voss on bridges of longest cycles
Jie Ma, Rongxing Xu
Bridges are a classical concept in structural graph theory and play a fundamental role in the study of cycles. A conjecture of Voss from 1991 asserts that if disjoint bridges $B_1,…
Intersections of longest cycles in vertex-transitive and highly connected graphs
Jie Ma, Ziyuan Zhao
Motivated by the classical conjectures of Lovász, Thomassen, and Smith, recent work has renewed interest in the study of longest cycles in important graph families, such as vertex-…