6 citations · 23 across the 19 of their papers we have counts for
4 papers · 1 filter
A conjecture of Verstraëte on vertex-disjoint cycles
Jun Gao, Jie Ma
Answering a question of Häggkvist and Scott, Verstraëte proved that every sufficiently large graph with average degree at least contains vertex-disjoint cycles of…
A unified proof of conjectures on cycle lengths in graphs
Jun Gao, Qingyi Huo, Chun-Hung Liu +1
In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression…
Minimum degree of 3-graphs without long linear paths
Yue Ma, Xinmin Hou, Jun Gao
A well known theorem in graph theory states that every graph on vertices and minimum degree at least contains a path of length at least , and if is connected and…
On a conjecture of Bondy and Vince
Jun Gao, Jie Ma
Twenty years ago Bondy and Vince conjectured that for any nonnegative integer , except finitely many counterexamples, every graph with vertices of degree less than three con…