2 citations · 2 across the 4 of their papers we have counts for
4 papers
Rainbow matchings for 3-uniform hypergraphs
Hongliang Lu, Xingxing Yu, Xiaofan Yuan
Kühn, Osthus, and Treglown and, independently, Khan proved that if is a -uniform hypergraph with vertices such that and large, and $δ_1(H)>{n-1\choose…
4-Separations in Hajós Graphs
Qiqin Xie, Shijie Xie, Xiaofan Yuan +1
As a natural extension of the Four Color Theorem, Hajós conjectured that graphs containing no -subdivision are 4-colorable. Any possible counterexample to this conjecture with…
Wheels in planar graphs and Hajós graphs
Qiqin Xie, Shijie Xie, Xingxing Yu +1
It was conjectured by Hajós that graphs containing no -subdivision are 4-colorable. Previous results show that any possible minimum counterexample to Hajós' conjecture, called…
Near perfect matchings in uniform hypergraphs
Hongliang Lu, Xingxing Yu, Xiaofan Yuan
In this paper, we study degree conditions for the existence of large matchings in uniform hypergraphs. We prove that for integers with , , and large, i…