6 papers
Generalized Nordhaus--Gaddum Inequalities for Eigenvalues
Sahil Agarwal, Carter Antley, Joseph Aulenbacher +6
For a graph , let denote the adjacency eigenvalues of . We investigate the asymptotic maximum of \[ λ_i(G)+λ_j(\overline G) \] f…
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…
Spectral radius and Hamiltonicity of uniform hypergraphs
George Brooks, William Linz, Ruth Luo
Let and be integers with . We prove that any -uniform hypergraph on vertices with spectral radius m…
Maximum spectral gaps of graphs
George Brooks, William Linz, Linyuan Lu
The spread of a graph is the difference between the largest and smallest eigenvalues of its adjacency matrix. Breen, Riasanovsky, Tait and Urschel recently determ…
Outerplanar graphs with positive Lin-Lu-Yau curvature
George Brooks, Fadekemi Osaye, Anna Schenfisch +2
In this paper, we show that all simple outerplanar graphs with minimum degree at least and positive Lin-Lu-Yau Ricci curvature on every edge have maximum degree at most …
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…