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

4 papers · 1 filter

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$ ,…

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

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