Michael Tait

most citedIncreasing paths in edge-ordered graphs: the hypercube and random graphs

4 citations · 7 across the 5 of their papers we have counts for

collaborators

6 papers

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.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}\…

math.CO2015★ 4 cited

Increasing paths in edge-ordered graphs: the hypercube and random graphs

Jessica De Silva, Theodore Molla, Florian Pfender +2

An edge-ordering of a graph $G = (V, E)$ is a bijection $ϕ : E \to {1, 2, ..., ∣ E ∣}$ . Given an edge-ordering, a sequence of edges $P = e_{1}, e_{2}, ..., e_{k}$ is an increasing path if it is a path…

math.CO2015★ 2 cited

Small dense subgraphs of polarity graphs and the extremal number for the 4-cycle

Michael Tait, Craig Timmons

In this note, we show that for any $m \in {1, 2, \dots, q + 1}$ , if $G$ is a polarity graph of a projective plane of order $q$ that has an oval, then $G$ contains a subgraph on $…