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 2021Show all

5 papers · 1 filter

math.CO2021

Spectral radius and $[a, b]$ -factors in graphs

Dandan Fan, Huiqiu Lin, Hongliang Lu

An $[a, b]$ -factor of a graph $G$ is a spanning subgraph $H$ such that $a \leq d_{H} (v) \leq b$ for each $v \in V (G)$ . In this paper, we provide spectral conditions for the existence o…

math.CO2021

Co-degree threshold for rainbow perfect matchings in uniform hypergraphs

Hongliang Lu, Yan Wang, Xingxing Yu

Let $k$ and $n$ be two integers, with $k \geq 3$ , $n \equiv 0 (mod k)$ , and $n$ sufficiently large. We determine the $(k - 1)$ -degree threshold for the existence of a rainbow perfect ma…

math.CO2021★ 1 cited

Rainbow perfect matchings for 4-uniform hypergraphs

Hongliang Lu, Yan Wang, Xingxing Yu

Let $n$ be a sufficiently large integer with $n \equiv 0 (mod 4)$ and let $F_{i} \subseteq (4 [ n ])$ where $i \in [n /4]$ . We show that if each vertex of $F_{i}$ is contained in more…

math.CO2021

A note on exact minimum degree threshold for fractional perfect matchings

Hongliang Lu, Xingxing Yu

Rödl, Ruciński, and Szemerédi determined the minimum $(k - 1)$ -degree threshold for the existence of fractional perfect matchings in $k$ -uniform hypergrahs, and Kühn, Osthus, and Tow…

math.CO2021

A stability result on matchings in 3-uniform hypergraphs

Mingyang Guo, Hongliang Lu, Dingjia Mao

Let $n, s, k$ be three positive integers such that $1 \leq s \leq (n - k + 1) / k$ and let $[n] = {1, \dots, n}$ . Let $H$ be a $k$ -graph with vertex set ${1, \dots, n}$ , and let $e (H)$ denote…

Spectral radius and [a,b]-factors in graphs

Co-degree threshold for rainbow perfect matchings in uniform hypergraphs

Rainbow perfect matchings for 4-uniform hypergraphs

A note on exact minimum degree threshold for fractional perfect matchings

A stability result on matchings in 3-uniform hypergraphs

Spectral radius and $[a, b]$ -factors in graphs