12 citations · 12 across the 1 of their papers we have counts for
5 papers
The maximum relaxation time of a random walk
Sinan G. Aksoy, Fan Chung, Michael Tait +1
We show the minimum spectral gap of the normalized Laplacian over all simple, connected graphs on vertices is . This minimum is achieved asymptotically…
Three conjectures in extremal spectral graph theory
Michael Tait, Josh Tobin
We prove three conjectures regarding the maximization of spectral invariants over certain families of graphs. Our most difficult result is that the join of and is t…
Characterizing graphs of maximum principal ratio
Michael Tait, Josh Tobin
The principal ratio of a connected graph, denoted , is the ratio of the maximum and minimum entries of its first eigenvector. Cioabă and Gregory conjectured that the graph on…
On the Principal Permanent Rank Characteristic Sequences of Graphs and Digraphs
Keivan Hassani Monfared, Paul Horn, Franklin H. J. Kenter +3
The principal permanent rank characteristic sequence is a binary sequence where if there exists a principal square submatrix of size with nonzero…
Knot Floer Filtration Classes of Topologically Slice Knots
Joshua Tobin
The knot Floer complex and the concordance invariant can be used to define a filtration on the smooth concordance group. We exhibit an ordered subset of this filtrati…