Rongrong Lu

collaborators

3 papers

math.CO2026

A Spectral Hilton--Milner--Frankl Theorem for $t$ -Intersecting Families

Xucheng Bu, Lihua Feng, Lu Lu +1

Keevash, Lenz, and Mubayi proved a spectral Erdős--Ko--Rado theorem, showing that, for sufficiently large $n$ , the complete $t$ -star uniquely maximizes the adjacency-tensor spectra…

math.CO2026

An improved range for the maximum critically $t$ -intersecting hypergraphs

Lu Lu, Rongrong Lu, Qifan Wang +1

Let $k > t \geq 1$ be integers and set $d = k - t$ . A $k$ -uniform hypergraph $F$ is called $t$ -intersecting if any two edges intersect in at least $t$ vertices, and is called $t$ -…

math.CO2025

The number of rooted spanning forests of bicirculant graphs

Jing Yang, Lihua Feng, Rongrong Lu +1

A bi-Cayley graph over the cyclic group $(Z_{n}, +)$ is called a bicirculant graph. Let $Γ = B C (Z_{n}; R, T, S)$ be a bicirculant graph with $R=-R\subseteq \mathbb{Z}_n\s…

A Spectral Hilton--Milner--Frankl Theorem for t-Intersecting Families

An improved range for the maximum critically t-intersecting hypergraphs

The number of rooted spanning forests of bicirculant graphs

A Spectral Hilton--Milner--Frankl Theorem for $t$ -Intersecting Families

An improved range for the maximum critically $t$ -intersecting hypergraphs