combinatorial bounds 1critical hypergraphs 1extremal hypergraph theory 1intersecting families 1t-intersecting 1
From the 1 of 3 linked papers with an AI index.
3 papers
math.CO2026
A Spectral Hilton--Milner--Frankl Theorem for -Intersecting Families
Xucheng Bu, Lihua Feng, Lihua Deng +2
Keevash, Lenz, and Mubayi proved a spectral Erdős--Ko--Rado theorem, showing that, for sufficiently large , the complete -star uniquely maximizes the adjacency-tensor spectra…
math.CO2026
An improved range for the maximum critically -intersecting hypergraphs
Lu Lu, Rongrong Lu, Qifan Wang +1
The paper proves that for k-uniform hypergraphs that are t‑intersecting and t‑critical, the maximum number of edges is bounded by \(\binom{k+d}{d}\) when k > 30·d², confirming Fran…
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 is called a bicirculant graph. Let be a bicirculant graph with $R=-R\subseteq \mathbb{Z}_n\…