1 citations · 1 across the 11 of their papers we have counts for
12 papers
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) +…
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…
-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 …
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…
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…
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…
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 eigenvalues of the adjacency matrix of . In this paper, we consider the family of graphs which conta…
On the maximum spread of planar and outerplanar graphs
Zelong Li, William Linz, Linyuan Lu +1
The spread of a graph is the difference between the largest and smallest eigenvalue of the adjacency matrix of . Gotshall, O'Brien and Tait conjectured that for sufficiently…
On the sizes of -intersecting -chain-free families
József Balogh, William B. Linz, Balázs Patkós
A set system is -\textit{intersecting}, if the size of the intersection of every pair of its elements has size at least . A set system is -\tex…
-Catalan numbers and Littlewood-Richardson polynomials
William Linz
In this note, we study two generalizations of the Catalan numbers, namely the -Catalan numbers and the spin -Catalan numbers. These numbers first appeared in relation to quan…
Short proofs of three results about intersecting systems
József Balogh, William Linz
In this note, we give short proofs of three theorems about intersection problems. The first one is a determination of the maximum size of a nontrivial -uniform, -wise interse…
Long rainbow arithmetic progressions
József Balogh, William Linz, Letícia Mattos
Define as the minimal for which there is a rainbow arithmetic progression of length in every equinumerous -coloring of for all $n\in \mathbb{N…