9 citations · 39 across the 35 of their papers we have counts for
6 papers · 1 filter
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…
Partitioning digraphs with outdegree at least 4
Guanwu Liu, Xingxing Yu
Scott asked the question of determining such that if is a digraph with arcs and minimum outdegree then has a partition such that $\min\left…
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…
A better bound on the size of rainbow matchings
Hongliang Lu, Yan Wang, Xingxing Yu
Aharoni and Howard conjectured that, for positive integers with and , if such that $|F_i|>{n\choose k}-{n-t+1\cho…
Large cycles in essentially 4-connected graphs
Michael Wigal, Xingxing Yu
Tutte proved that every 4-connected planar graph contains a Hamilton cycle, but there are 3-connected -vertex planar graphs whose longest cycles have length . On…