4 papers
math.CO2026
Exact local spectral thresholds for perfect matchings in -graphs and -partite -graphs
Pei Liu, Suil O
For a -uniform hypergraph , let be the minimum over the vertices of of the spectral radius of the link. Lin, Lu, Yuan and Zhao conjectured that $σ(H)>\tfrac{2n}3-2…
math.CO2026
The maximum spectral radius of uniform hypergraphs whose shadow excludes a complete or complete bipartite minor
Pei Liu, Suil O
For a -uniform hypergraph , the shadow of is the graph whose edges are the pairs covered by a hyperedge. In this paper, for all sufficiently large ,…
math.CO2026
The maximum spectral radius of outerplanar and planar -uniform hypergraphs
Pei Liu, Suil O
For an integer , a -angulation is a simple -connected outerplane graph whose interior faces are bounded by -cycles, and a closed -angulation is a simple -conn…
math.CO2026
A sharp Randić bound for König--Egerváry graphs and a conjecture of Aouchiche, Hansen, and Zheng
Pei Liu, Feiyu Nan, Suil O +1
Let be the matching number of a graph , and let its Randić index be . In 2006, Aouchiche, Hansen, and Zheng conjectured that the…