3 papers
math.CO2026
Maximum spread of -minor-free graphs II: the non-admissible cases
William Linz, Linyuan Lu, Zhiyu Wang
We have previously determined the maximum-spread -minor-free graph(s) on vertices when is sufficiently large, , and or $t\ge \frac{3}{2}(s-3) +…
math.CO2026
Some exact and asymptotic results for hypergraph Turán problems in -norm
George Brooks, William Linz
For a -uniform hypergraph , the \emph{codegree squared sum} is the square of the -norm of the codegree vector of , a…
math.CO2025
Maximum spread of -minor-free graphs
William Linz, Linyuan Lu, Zhiyu Wang
The spread of a graph is the difference between the largest and smallest eigenvalue of the adjacency matrix of . In this paper, we consider the family of graphs which contai…