79 citations · 217 across the 44 of their papers we have counts for
5 papers · 1 filter
Cycle lengths in graphs of given minimum degree
Yandong Bai, Andrzej Grzesik, Binlong Li +1
We prove that if is a 2-connected graph with minimum degree at least , then (1) contains cycles whose lengths form an arithmetic progression with common d…
Localized and weighted versions of extremal problems
Binlong Li, Bo Ning
Malec and Tompkins (EUJC, 2023) considered the localized versions of Turán-type problems, and proved a localized theorem on Erdős-Gallai Theorem on paths. Zhao and Zhang (JGT, 2025…
A note on two cycles of consecutive even lengths in graphs
Binlong Li, Yufeng Pan, Lingjuan Shi
Bondy and Vince proved that a graph of minimum degree at least three contains two cycles whose lengths differ by one or two, which was conjectured by Erdős. Gao, Li, Ma and Xie gav…
Characterizing forbidden pairs for spanning -subgraphs of 2-connected graphs
Binlong Li, Ziqing Sang, Shipeng Wang
Let be a set of connected graphs, and let be a graph. We say that is \emph{-free} if it does not contain as an induced subgraph for all $F\in…
On graphs without cycles of length 1 modulo 3
Yandong Bai, Binlong Li, Yufeng Pan +1
Burr and Erdős conjectured in 1976 that for every two integers satisfying that contains an even integer, an -vertex graph containing no cy…