Showing math.COShow all
2 papers · 1 filter
math.CO2026
The Erdős-Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang +2
Erdős and Gallai in 1959 proved the seminal result that every -vertex graph with no cycle of length at least has at most edges. We prove the extens…
math.CO2024
Topological cliques in sparse expanders
Xia Wang, Donglei Yang, Fan Yang +1
In the paper, we focus on embedding clique immersions and subdivisions within sparse expanders, and we derive the following main results: (1) For any , there exists $K>0…