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

47 papers

math.CO2026

A spectral condition for perfect matchings in 3-partite 3-graphs

Hongliang Lu, Feihong Yuan

Let $H$ be a 3-partite 3-uniform hypergraph whose three vertex classes all have size $n$ . For a vertex $v \in V (H)$ , the link graph $N_{H} (v)$ is defined on $V (H) ∖ {v}$ with…

math.CO2023

Anti-Ramsey number of matchings in $3$ -uniform hypergraphs

Mingyang Guo, Hongliang Lu, Xing Peng

Let $n, s,$ and $k$ be positive integers such that $k \geq 3$ , $s \geq 3$ and $n \geq k s$ . An $s$ -matching $M_{s}$ in a $k$ -uniform hypergraph is a set of $s$ pairwise disjoint edges. Th…

math.CO2023

On stability of rainbow matchings

Hongliang Lu, Yan Wang, Xingxing Yu

We show that for any integer $k \geq 1$ there exists an integer $t_{0} (k)$ such that for integers $t, k_{1}, \dots, k_{t + 1}, n$ with $t > t_{0} (k)$ , $max {k_{1}, \dots, k_{t + 1}} \leq k$ , and…

math.CO2022

Spectral radius and rainbow matchings of graphs

Mingyang Guo, Hongliang Lu, Xinxin Ma +1

Let $n, m$ be integers such that $1 \leq m \leq (n - 2) /2$ and let $[n] = {1, \dots, n}$ . Let $G = {G_{1}, \dots, G_{m + 1}}$ be a family of graphs on the same vertex set $[n]$ . In…

math.CO2022

Toughness, hamiltonicity and spectral radius in graphs

Dandan Fan, Huiqiu Lin, Hongliang Lu

The study of the existence of hamiltonian cycles in a graph is a classic problem in graph theory. By incorporating toughness and spectral conditions, we can consider Chvátal's conj…

math.CO2021

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