2 citations · 5 across the 8 of their papers we have counts for
12 papers · 1 filter
On two cycles of consecutive even lengths
Jun Gao, Binlong Li, Jie Ma +1
Bondy and Vince showed that every graph with minimum degree at least three contains two cycles of lengths differing by one or two.We prove the following average degree counterpart…
Rainbow independent sets in graphs with maximum degree two
Yue Ma, Xinmin Hou, Jun Gao +2
Given a graph , let be the minimal number such that every independent -sets in have a rainbow -set. Let be the family of all grap…
A strengthening on odd cycles in graphs of given chromatic number
Jun Gao, Qingyi Huo, Jie Ma
Resolving a conjecture of Bollobás and Erdős, Gyárfás proved that every graph of chromatic number contains cycles of distinct odd length…
On the rainbow matching conjecture for 3-uniform hypergraphs
Jun Gao, Hongliang Lu, Jie Ma +1
Aharoni and Howard, and, independently, Huang, Loh, and Sudakov proposed the following rainbow version of Erdős matching conjecture: For positive integers with , i…
Minimizing the number of edges in -saturated graphs
Yue Ma, Xinmin Hou, Doudou Hei +1
Given a family of graphs , a graph is said to be -saturated if does not contain a copy of as a subgraph for any but the addi…
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…