4 papers
Towards a strengthening of the second neighborhood conjecture
Yandong Bai, Binlong Li, Boram Park
A longstanding conjecture of Seymour, called Seymour's second neighborhood conjecture, states that every oriented graph contains a vertex with $|N^{++}_D(x)|\geq |N^{+}_D(x…
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, 20…
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 ga…