Showing 2026Show all
2 papers · 1 filter
math.CO2026
A reduction principle for non--partite spectral extremal problems, with a complete multipartite classification
Suil O, Jiadong Wu
A graph is non--partite if its chromatic number exceeds . For an edge-color-critical graph with , let be the maximum adjacency spectr…
math.CO2026
The signless Laplacian spectral Turán problems for hypergraphs
Yongchun Lu, Jiadong Wu, Liying Kang
Let be an -uniform hypergraph on vertices. The signless Laplacian spectral radius of is defined as the maximum modulus of the eigenvalues…