Michael Tait

activity

20132023

most citedThe maximum relaxation time of a random walk

12 citations · 71 across the 46 of their papers we have counts for

collaborators

Showing 2016 · math.COShow all

4 papers · 2 filters

math.CO2016

Degree Ramsey numbers for even cycles

Michael Tait

Let $H s G$ denote that any $s$ -coloring of $E (H)$ contains a monochromatic $G$ . The degree Ramsey number of a graph $G$ , denoted by $R_{Δ} (G, s)$ , is $\min \{Δ(H): H \x…

math.CO2016

Induced Turán numbers

Po-Shen Loh, Michael Tait, Craig Timmons +1

The classical Kővári-Sós-Turán theorem states that if $G$ is an $n$ -vertex graph with no copy of $K_{s, t}$ as a subgraph, then the number of edges in $G$ is at most $O (n^{2 - 1/ s})$ .…

math.CO2016

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 $P_{2}$ and $P_{n - 2}$ is t…

math.CO2016

Independent sets in polarity graphs

Michael Tait, Craig Timmons

Given a projective plane $Σ$ and a polarity $θ$ of $Σ$ , the corresponding polarity graph is the graph whose vertices are the points of $Σ$ , and two distinct points $p_{1}$ and $p_{2}$ …