Craig Timmons

activity

20132024

most citedFew

T

copies in

H

-saturated graphs

3 citations · 11 across the 28 of their papers we have counts for

collaborators

Showing 2018Show all

4 papers · 1 filter

math.CO2018★ 3 cited

Few $T$ copies in $H$ -saturated graphs

Jürgen Kritschgau, Abhishek Methuku, Michael Tait +1

A graph is $F$ -saturated if it is $F$ -free but the addition of any edge creates a copy of $F$ . In this paper we study the quantity $sat (n, H, F)$ which denotes the minimum…

math.CO2018

$C_{2 k}$ -saturated graphs with no short odd cycles

Craig Timmons

The saturation number of a graph $F$ , written $sat (n, F)$ , is the minimum number of edges in an $n$ -vertex $F$ -saturated graph. One of the earliest results on saturation nu…

math.CO2018

The Anti-Ramsey Problem for the Sidon equation

Vladislav Taranchuk, Craig Timmons

For $n \geq k \geq 4$ , let $A R_{X + Y = Z + T}^{k} (n)$ be the maximum number of rainbow solutions to the Sidon equation $X + Y = Z + T$ over all $k$ -colorings $c : [n] \to [k]$ .…

math.CO2018

The Zarankiewicz problem in 3-partite graphs

Michael Tait, Craig Timmons

Let $F$ be a graph, $k \geq 2$ be an integer, and write $ex_{χ \leq k} (n, F)$ for the maximum number of edges in an $n$ -vertex graph that is $k$ -partite and has no subg…

Few T copies in H-saturated graphs

C2k​-saturated graphs with no short odd cycles

The Anti-Ramsey Problem for the Sidon equation

The Zarankiewicz problem in 3-partite graphs

Few $T$ copies in $H$ -saturated graphs

$C_{2 k}$ -saturated graphs with no short odd cycles