activity
20192026
collaborators
Showing math.COShow all

9 papers · 1 filter

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.CO2024

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…

math.CO2024

-systems and the Lovász number

William Linz

Given integers , and a set of integers , an \emph{-system} is a family of sets such that

math.CO2023

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.CO2023

On the maximum second eigenvalue of outerplanar graphs

George Brooks, Maggie Gu, Jack Hyatt +2

For a fixed positive integer and a graph , let denote the -th largest eigenvalue of the adjacency matrix of . In 2017, Tait and Tobin proved that the maximum…

math.CO2023

Improved lower bounds on the extrema of eigenvalues of graphs

William Linz

In this note, we improve the lower bounds for the maximum size of the th largest eigenvalue of the adjacency matrix of a graph for several values of . In particular, we show…