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

6 papers · 1 filter

math.CO2013

A counterexample to sparse removal

Craig Timmons, Jacques Verstraete

The Turán number of a graph $H$ , denoted $\mbox{ex}(n,H)$, is the maximum number of edges in an $n$ -vertex graph with no subgraph isomorphic to $H$ . Solymosi conjectured that if $H…

math.CO2013

Bounds for generalized Sidon sets

Xing Peng, Rafael Tesoro, Craig Timmons

Let $Γ$ be an abelian group and $g \geq h \geq 2$ be integers. A set $A \subset Γ$ is a $C_{h} [g]$ -set if given any set $X \subset Γ$ with $∣ X ∣ = k$ , and any set $\{ k_1 , \dots , k_…

math.CO2013

k-fold Sidon sets

Javier Cilleruelo, Craig Timmons

Let $k \geq 1$ be an integer. A set $A \subset Z$ is a $k$ -fold Sidon set if $A$ has only trivial solutions to each equation of the form $c_1 x_1 + c_2 x_2 + c_3 x_3 + c_4…

math.CO2013

Sidon Sets and graphs without 4-cycles

Michael Tait, Craig Timmons

The problem of determining the maximum number of edges in an $n$ -vertex graph that does not contain a 4-cycle has a rich history in extremal graph theory. Using Sidon sets construc…

math.CO2013

Upper and lower bounds on $B_{k}^{+}$ -sets

Craig Timmons

Let $G$ be an abelian group. A set $A \subset G$ is a \emph{ $B_{k}^{+}$ -set} if whenever $a_{1} + \dots + a_{k} = b_{1} + \dots + b_{k}$ with $a_{i}, b_{j} \in A$ there is an $i$ and a $j$ such th…

math.CO2013

Infinite Turán problems for bipartite graphs

Xing Peng, Craig Timmons

We consider an infinite version of the bipartite Turán problem. Let $G$ be an infinite graph with $V (G) = N$ and let $G_{n}$ be the $n$ -vertex subgraph of $G$ induced by the…

A counterexample to sparse removal

Bounds for generalized Sidon sets

k-fold Sidon sets

Sidon Sets and graphs without 4-cycles

Upper and lower bounds on Bk+​-sets

Infinite Turán problems for bipartite graphs

Upper and lower bounds on $B_{k}^{+}$ -sets