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

4 papers · 1 filter

math.CO2016

Induced Turán numbers

Po-Shen Loh, Michael Tait, Craig Timmons +1

The classical Kővári-Sós-Turán theorem states that if $G$ is an $n$ -vertex graph with no copy of $K_{s, t}$ as a subgraph, then the number of edges in $G$ is at most $O (n^{2 - 1/ s})$ .…

math.CO2016

On $r$ -uniform linear hypergraphs with no Berge- $K_{2, t}$

Craig Timmons

Let $F$ be an $r$ -uniform hypergraph and $G$ be a multigraph. The hypergraph $F$ is a Berge- $G$ if there is a bijection $f : E (G) \to E (F)$ s…

math.CO2016

Upper bounds for $B_{h} [g]$ -sets with small $h$

Craig Timmons

For $g \geq 2$ and $h \geq 3$ , we give small improvements on the maximum size of a $B_{h} [g]$ -set contained in the interval ${1, 2, \dots, N}$ . In particular, we show that a $B_3[…

math.CO2016

Independent sets in polarity graphs

Michael Tait, Craig Timmons

Given a projective plane $Σ$ and a polarity $θ$ of $Σ$ , the corresponding polarity graph is the graph whose vertices are the points of $Σ$ , and two distinct points $p_{1}$ and $p_{2}$ …

Induced Turán numbers

On r-uniform linear hypergraphs with no Berge-K2,t​

Upper bounds for Bh​[g]-sets with small h

Independent sets in polarity graphs

On $r$ -uniform linear hypergraphs with no Berge- $K_{2, t}$

Upper bounds for $B_{h} [g]$ -sets with small $h$