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 2017Show all

6 papers · 1 filter

math.CO2017

On Edge-Colored Saturation Problems

Michael Ferrara, Daniel Johnston, Sarah Loeb +6

Let $C$ be a family of edge-colored graphs. A $t$ -edge colored graph $G$ is $(C, t)$ -saturated if $G$ does not contain any graph in $C$ but the additi…

math.CO2017★ 1 cited

Maximal Planar Subgraphs of Fixed Girth in Random Graphs

Manuel Fernández, Nicholas Sieger, Michael Tait

In 1991, Bollobás and Frieze showed that the threshold for $G_{n, p}$ to contain a spanning maximal planar subgraph is very close to $p = n^{- 1/3}$ . In this paper, we compute simila…

math.CO2017

Turán numbers for Berge-hypergraphs and related extremal problems

Cory Palmer, Michael Tait, Craig Timmons +1

Let $F$ be a graph. We say that a hypergraph $H$ is a {\it Berge}- $F$ if there is a bijection $f : E (F) \to E (H)$ such that $e \subseteq f (e)$ for every $e \in E (F)$ . Note…

math.NT2017

A structure theorem for product sets in extra special groups

Thang Pham, Michael Tait, Le Anh Vinh +1

Hegyvári and Hennecart showed that if $B$ is a sufficiently large brick of a Heisenberg group, then the product set $B \cdot B$ contains many cosets of the center of the group. We g…

math.CO2017★ 1 cited

The Colin de Verdière parameter, excluded minors, and the spectral radius

Michael Tait

In this paper we characterize graphs which maximize the spectral radius of their adjacency matrix over all graphs of Colin de Verdière parameter at most $m$ . We also characterize g…

math.CO2017

Degenerate Turán problems for hereditary properties

Vladimir Nikiforov, Michael Tait, Craig Timmons

Let $H$ be a graph and $t \geq s \geq 2$ be integers. We prove that if $G$ is an $n$ -vertex graph with no copy of $H$ and no induced copy of $K_{s, t}$ , then $λ(G) = O\left(n^{1-1/s}\…