Craig M. Timmons, Ph.D.
Affiliations: | 2014 | Mathematics | University of California, San Diego, La Jolla, CA |
Area:
MathematicsGoogle:
"Craig Timmons"Parents
Sign in to add mentorJacques Verstraete | grad student | 2014 | UCSD | |
(Extremal Graphs and Additive Combinatorics.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Kritschgau J, Methuku A, Tait M, et al. (2020) Few H copies in F‐saturated graphs Journal of Graph Theory. 94: 320-348 |
Palmer C, Tait M, Timmons C, et al. (2019) Turán numbers for Berge-hypergraphs and related extremal problems Discrete Mathematics. 342: 1553-1563 |
Taranchuk V, Timmons C. (2019) The anti-Ramsey problem for the Sidon equation Discrete Mathematics. 342: 2856-2866 |
Timmons C. (2019) $$C_{2k}$$ C 2 k -Saturated Graphs with No Short Odd Cycles Graphs and Combinatorics. 35: 1023-1034 |
Tait M, Timmons C. (2019) The Zarankiewicz problem in 3-partite graphs Journal of Combinatorial Designs. 27: 391-405 |
Loh P, Tait M, Timmons C, et al. (2018) Induced Turán Numbers Combinatorics, Probability & Computing. 27: 274-288 |
Coulter RS, Matthews RW, Timmons C. (2018) Planar polynomials and an extremal problem of Fischer and Matoušek Journal of Combinatorial Theory, Series B. 128: 96-103 |
Timmons C. (2017) On $r$-Uniform Linear Hypergraphs with no Berge-$K_{2,t}$ Electronic Journal of Combinatorics. 24: 4-34 |
Peng X, Timmons C. (2017) A path Turán problem for infinite graphs Discrete Mathematics. 340: 181-191 |
Tait M, Timmons C. (2016) Independent Sets in Polarity Graphs Siam Journal On Discrete Mathematics. 30: 2115-2129 |