12 citations · 71 across the 46 of their papers we have counts for
4 papers · 1 filter
Geometric structures in pseudo-random graphs
Thang Pham, Steven Senger, Michael Tait +1
In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the fi…
Sparsity of Graphs that Allow Two Distinct Eigenvalues
Wayne Barrett, Shaun Fallat, Veronika Furst +5
The parameter of a graph is the minimum number of distinct eigenvalues over the family of symmetric matrices described by . It is shown that the minimum number of edg…
A spectral Erdős-Sós theorem
Sebastian Cioabă, Dheer Noal Desai, Michael Tait
The famous Erdős-Sós conjecture states that every graph of average degree more than must contain every tree on vertices. In this paper, we study a spectral version of t…
The spectral even cycle problem
Sebastian Cioabă, Dheer Noal Desai, Michael Tait
In this paper, we study the maximum adjacency spectral radii of graphs of large order that do not contain an even cycle of given length. For , let be the join of a c…