Hongliang Lu

activity

20102026

most citedA better bound on the size of rainbow matchings

9 citations · 37 across the 47 of their papers we have counts for

collaborators

Showing 2016Show all

3 papers · 1 filter

math.CO2016

On rainbow matchings for hypergraphs

Hongliang Lu, Xingxing Yu

For any posotive integer $m$ , let $[m] := {1, \dots, m}$ . Let $n, k, t$ be positive integers. Aharoni and Howard conjectured that if, for $i \in [t]$ , $\mathcal{F}_i\subset[n]^k:= \{(a…

math.CO2016★ 1 cited

Almost perfect matchings in $k$ -partite $k$ -graphs

Hongliang Lu, Yan Wang, Xingxing Yu

The minimum co-degree threshold for a perfect matching in a $k$ -graph with $n$ vertices was determined by Rödl, Ruciński and Szemerédi for the case when $n \equiv 0 (mod k)$ . Recentl…

math.CO2016

A Degree Condition for a Graph to have $(a, b)$ -Parity Factors

Haodong Liu, Hongliang Lu

Let $a, b, n$ be three positive integers such that $a \equiv b (mod 2)$ and $n \geq b (a + b) (a + b + 2) / (2 a)$ . Let $G$ be a graph of order $n$ with minimum degree at least $a + b / a - 1$ . We show…

On rainbow matchings for hypergraphs

Almost perfect matchings in k-partite k-graphs

A Degree Condition for a Graph to have (a,b)-Parity Factors

Almost perfect matchings in $k$ -partite $k$ -graphs

A Degree Condition for a Graph to have $(a, b)$ -Parity Factors