William Linz

activity

20192026

K_{2, t}

-minor-free graphs

1 citations · 1 across the 11 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

math.CO2022★ 1 cited

Maximum spread of $K_{2, t}$ -minor-free graphs

William Linz, Linyuan Lu, Zhiyu Wang

The spread of a graph $G$ is the difference between the largest and smallest eigenvalues of the adjacency matrix of $G$ . In this paper, we consider the family of graphs which conta…

math.CO2022

On the maximum spread of planar and outerplanar graphs

Zelong Li, William Linz, Linyuan Lu +1

The spread of a graph $G$ is the difference between the largest and smallest eigenvalue of the adjacency matrix of $G$ . Gotshall, O'Brien and Tait conjectured that for sufficiently…

math.CO2022

On the sizes of $t$ -intersecting $k$ -chain-free families

József Balogh, William B. Linz, Balázs Patkós

A set system $F$ is $t$ -\textit{intersecting}, if the size of the intersection of every pair of its elements has size at least $t$ . A set system $F$ is $k$ -\tex…

Maximum spread of K2,t​-minor-free graphs

On the maximum spread of planar and outerplanar graphs

On the sizes of t-intersecting k-chain-free families

Maximum spread of $K_{2, t}$ -minor-free graphs

On the sizes of $t$ -intersecting $k$ -chain-free families