Michael Tait

collaborators

3 papers

math.CO2026

Maximum spectral sum of graphs

Hitesh Kumar, Lele Liu, Hermie Monterde +2

For a graph $G$ of order $n$ , the spectral sum of $G$ is defined to be the sum $I^»_{1} (G) + I^»_{2} (G)$ , where $I^»_{1} (G)$ (resp. $I^»_{2} (G)$ ) is the largest (resp. second largest) adjacenc…

math.CO2025

A general theorem in spectral extremal graph theory

John Byrne, Dheer Noal Desai, Michael Tait

The extremal graphs $EX (n, F)$ and spectral extremal graphs $SPEX (n, F)$ are the sets of graphs on $n$ vertices with maximum number of edges and m…

math.CO2025

Cardinalities of $g$ -difference sets

Eric Schmutz, Michael Tait

Let $I^\cdot_{g} (n)$ be the smallest cardinality that $A \subseteq Z$ can have if $A$ is a $g$ -difference basis for $[n]$ (i.e, if, for each $x \in [n]$ , there are {\em at leas…

Maximum spectral sum of graphs

A general theorem in spectral extremal graph theory

Cardinalities of g-difference sets

Cardinalities of $g$ -difference sets