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

5 papers · 1 filter

math.CO2017

Turán numbers for Berge-hypergraphs and related extremal problems

Cory Palmer, Michael Tait, Craig Timmons +1

Let $F$ be a graph. We say that a hypergraph $H$ is a {\it Berge}- $F$ if there is a bijection $f : E (F) \to E (H)$ such that $e \subseteq f (e)$ for every $e \in E (F)$ . Note…

math.CO2017★ 2 cited

A note on the number of edges in a Hamiltonian graph with no repeated cycle length

Joey Lee, Craig Timmons

Let $G$ be an $n$ -vertex graph obtained by adding chords to a cycle of length $n$ . Markström asked for the maximum number of edges in $G$ if there are no two cycles in $G$ with the…

math.CO2017★ 2 cited

Triangle-free induced subgraphs of polarity graphs

Jared Loucks, Craig Timmons

Given a finite projective plane $Π$ and a polarity $θ$ of $Π$ , the corresponding polarity graph is the graph whose vertices are the points of $Π$ . Two distinct vertices $p$ and $p'…

math.CO2017

Planar polynomials and an extremal problem of Fischer and Matousek

Robert S. Coulter, Rex W. Matthews, Craig Timmons

Let $G$ be a 3-partite graph with $k$ vertices in each part and suppose that between any two parts, there is no cycle of length four. Fischer and Matouusek asked for the maximum nu…

math.CO2017

Degenerate Turán problems for hereditary properties

Vladimir Nikiforov, Michael Tait, Craig Timmons

Let $H$ be a graph and $t \geq s \geq 2$ be integers. We prove that if $G$ is an $n$ -vertex graph with no copy of $H$ and no induced copy of $K_{s, t}$ , then $λ(G) = O\left(n^{1-1/s}\…