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

2 papers · 1 filter

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…