Yinfen Zhu

collaborators

2 papers

math.CO2026

Spectral extremal results for triangle-free graphs with chromatic number at least four

Yinfen Zhu, Huiqiu Lin

A graph is called $F$ -free if it does not contain a copy of $F$ . Let $G (r, s)$ denote a $K_{r + 1}$ -free graph of order $n$ with chromatic number at least $s$ that maximizes the spect…

math.SP2025

A note on the spectral radius and $[a, b]$ -factor of graphs

Dandan Fan, Huiqiu Lin, Yinfen Zhu

The investigation of eigenvalue conditions for the existence of an $[a, b]$ -factor originates in the work of Brouwer and Haemers (2005) on perfect matchings. In the decades since, s…

Spectral extremal results for triangle-free graphs with chromatic number at least four

A note on the spectral radius and [a,b]-factor of graphs

A note on the spectral radius and $[a, b]$ -factor of graphs