Craig Timmons

activity

20152021

most citedMinimizing the number of complete bipartite graphs in a

K_{s}

-saturated graph

2 citations · 6 across the 10 of their papers we have counts for

collaborators

15 papers

math.CO2021

Generalized sum-free sets and cycle saturated regular graphs

David Davini, Craig Timmons

Gerbner, Patkós, Tuza, and Vizer recently initiated the study of $F$ -saturated regular graphs. One of the essential problems in this line of research is determining when such a gra…

math.CO2021

Upper and lower bounds on the size of $B_{k} [g]$ sets

Griffin Johnston, Michael Tait, Craig Timmons

A subset $A$ of the integers is a $B_{k} [g]$ set if the number of multisets from $A$ that sum to any fixed integer is at most $g$ . Let $F_{k, g} (n)$ denote the maximum size of a $B_k[…

math.CO2021

Regular saturated graphs and sum-free sets

Craig Timmons

In a recent paper, Gerbner, Patkós, Tuza and Vizer studied regular $F$ -saturated graphs. One of the essential questions is given $F$ , for which $n$ does a regular $n$ -vertex $F$ -sa…

math.CO2021★ 2 cited

Minimizing the number of complete bipartite graphs in a $K_{s}$ -saturated graph

Beka Ergemlidze, Abhishek Methuku, Michael Tait +1

A graph $G$ is $F$ -saturated if it contains no copy of $F$ as a subgraph but the addition of any new edge to $G$ creates a copy of $F$ . We prove that for $s \geq 3$ and $t \geq 2$ ,…

math.CO2020

Regular Turán numbers of complete bipartite graphs

Michael Tait, Craig Timmons

Let $rex (n, F)$ denote the maximum number of edges in an $n$ -vertex graph that is regular and does not contain $F$ as a subgraph. We give lower bounds on $\mathrm{rex}(n,…

math.CO2019

Triangles in $K_{s}$ -saturated graphs with minimum degree $t$

Benjamin Cole, Albert Curry, David Davini +1

For $n \geq 15$ , we prove that the minimum number of triangles in an $n$ -vertex $K_{4}$ -saturated graph with minimum degree 4 is exactly $2 n - 4$ , and that there is a unique extremal g…

Generalized sum-free sets and cycle saturated regular graphs

Upper and lower bounds on the size of Bk​[g] sets

Regular saturated graphs and sum-free sets

Minimizing the number of complete bipartite graphs in a Ks​-saturated graph

Regular Turán numbers of complete bipartite graphs

Triangles in Ks​-saturated graphs with minimum degree t

Upper and lower bounds on the size of $B_{k} [g]$ sets

Minimizing the number of complete bipartite graphs in a $K_{s}$ -saturated graph

Triangles in $K_{s}$ -saturated graphs with minimum degree $t$