9 citations · 37 across the 47 of their papers we have counts for
7 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…
A characterization for graphs having strong parity factors
Hongliang Lu, Zixuan Yang, Xuechun Zhang
A graph has the \emph{strong parity property} if for every subset with even, has a spanning subgraph with minimum degree at least one such that $d_…
A Degree Condition for Graphs Having All -Parity Factors
Haodong Liu, Hongliang Lu
Let and be positive integers such that and . We say that has all -parity factors if has an -factor for every function $h: V(G…
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…
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…
Regular graphs with equal matching number and independence number
Hongliang Lu, Xixuan yang
Let be an integer and be a graph. Let , and denotes minimum degree, maximum degree, independence number and matching number of , respecti…