9 citations · 23 across the 13 of their papers we have counts for
26 papers · 1 filter
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…
Multicolor Ramsey numbers for Berge cycles
Zachary DeStefano, Hannah Mahon, Frank Simutis +1
In this paper, for small uniformities, we determine the order of magnitude of the multicolor Ramsey numbers for Berge cycles of length , , , , , or . Our result…
Maximum spread of graphs and bipartite graphs
Jane Breen, Alex W. N. Riasanovsky, Michael Tait +1
Given any graph , the (adjacency) spread of is the maximum absolute difference between any two eigenvalues of the adjacency matrix of . In this paper, we resolve a pair o…
Spectral extremal graphs for intersecting cliques
Dheer Noal Desai, Liying Kang, Yongtao Li +3
The -fan is the graph consisting of copies of the complete graph which intersect in a single vertex, and is denoted by . Erdős, Füredi, Gould and Gunderso…
Upper and lower bounds on the size of sets
Griffin Johnston, Michael Tait, Craig Timmons
A subset of the integers is a set if the number of multisets from that sum to any fixed integer is at most . Let denote the maximum size of a $B_k[…
The spectral radius of graphs with no odd wheels
Sebastian Cioabă, Dheer Noal Desai, Michael Tait
The odd wheel is the graph formed by joining a vertex to a cycle of length . In this paper, we investigate the largest value of the spectral radius of the adjacency…