4 papers
math.CO2026
An improved range for the maximum critically -intersecting hypergraphs
Lu Lu, Rongrong Lu, Qifan Wang +1
Let be integers and set . A -uniform hypergraph is called -intersecting if any two edges intersect in at least vertices, and is called -…
math.CO2026
Thresholds for the Frankl-Wang conjecture on maximum-degree ratios
Zejun Huang, Zhiyi Liu, Lu Lu +1
Let be an intersecting family, , and $\varrho(\mathcal{F})=Δ(\mathcal{F})/|\mathcal{F}…
math.CO2026
Bollobás-type inequalities for subspaces via weight invariance
Zhiyi Liu, Lihua Feng, Tingzeng Wu
Let be an -dimension real vector space with a direct sum decomposition . Let be a skew Bollobás…
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\s…