Year |
Citation |
Score |
2020 |
Kritschgau J, Methuku A, Tait M, Timmons C. Few H copies in F‐saturated graphs Journal of Graph Theory. 94: 320-348. DOI: 10.1002/Jgt.22525 |
0.519 |
|
2019 |
Palmer C, Tait M, Timmons C, Wagner AZ. Turán numbers for Berge-hypergraphs and related extremal problems Discrete Mathematics. 342: 1553-1563. DOI: 10.1016/J.Disc.2019.02.003 |
0.423 |
|
2019 |
Taranchuk V, Timmons C. The anti-Ramsey problem for the Sidon equation Discrete Mathematics. 342: 2856-2866. DOI: 10.1016/J.Disc.2018.12.004 |
0.412 |
|
2019 |
Timmons C. $$C_{2k}$$ C 2 k -Saturated Graphs with No Short Odd Cycles Graphs and Combinatorics. 35: 1023-1034. DOI: 10.1007/S00373-019-02054-X |
0.525 |
|
2019 |
Tait M, Timmons C. The Zarankiewicz problem in 3-partite graphs Journal of Combinatorial Designs. 27: 391-405. DOI: 10.1002/Jcd.21654 |
0.493 |
|
2018 |
Loh P, Tait M, Timmons C, Zhou RM. Induced Turán Numbers Combinatorics, Probability & Computing. 27: 274-288. DOI: 10.1017/S0963548317000542 |
0.547 |
|
2018 |
Coulter RS, Matthews RW, Timmons C. Planar polynomials and an extremal problem of Fischer and Matoušek Journal of Combinatorial Theory, Series B. 128: 96-103. DOI: 10.1016/J.Jctb.2017.08.001 |
0.518 |
|
2017 |
Timmons C. On $r$-Uniform Linear Hypergraphs with no Berge-$K_{2,t}$ Electronic Journal of Combinatorics. 24: 4-34. DOI: 10.37236/6470 |
0.39 |
|
2017 |
Peng X, Timmons C. A path Turán problem for infinite graphs Discrete Mathematics. 340: 181-191. DOI: 10.1016/J.Disc.2016.08.019 |
0.459 |
|
2016 |
Tait M, Timmons C. Independent Sets in Polarity Graphs Siam Journal On Discrete Mathematics. 30: 2115-2129. DOI: 10.1137/16M1057656 |
0.461 |
|
2016 |
Tait M, Timmons C. Orthogonal Polarity Graphs and Sidon Sets Journal of Graph Theory. 82: 103-116. DOI: 10.1002/Jgt.21890 |
0.54 |
|
2015 |
Peng X, Tait M, Timmons C. On the Chromatic Number of the Erdős-Rényi Orthogonal Polarity Graph Electronic Journal of Combinatorics. 22: 2-21. DOI: 10.37236/4893 |
0.321 |
|
2015 |
Timmons C, Verstraëte J. A counterexample to sparse removal European Journal of Combinatorics. 44: 77-86. DOI: 10.1016/J.Ejc.2014.09.008 |
0.579 |
|
2015 |
Peng X, Tesoro R, Timmons C. Bounds for generalized Sidon sets Discrete Mathematics. 338: 183-190. DOI: 10.1016/J.Disc.2014.11.006 |
0.489 |
|
2014 |
Tait M, Timmons C. Sidon sets and graphs without 4-cycles The Journal of Combinatorics. 5: 155-165. DOI: 10.4310/Joc.2014.V5.N2.A1 |
0.491 |
|
2014 |
Cilleruelo J, Timmons C. $k$-Fold Sidon Sets Electronic Journal of Combinatorics. 21: 4-12. DOI: 10.37236/3860 |
0.346 |
|
2014 |
Peng X, Timmons C. Infinite Turán Problems for Bipartite Graphs Siam Journal On Discrete Mathematics. 28: 702-710. DOI: 10.1137/130922987 |
0.517 |
|
2012 |
Timmons C. An Ordered Turán Problem for Bipartite Graphs Electronic Journal of Combinatorics. 19: 43. DOI: 10.37236/2471 |
0.558 |
|
2011 |
Cioabǎ SM, Kündgen A, Timmons CM, Vysotsky VV. Covering complete r-graphs with spanning complete r-partite r-graphs Combinatorics Probability and Computing. 20: 519-527. DOI: 10.1017/S096354831100006X |
0.356 |
|
2008 |
Timmons C. Star Coloring High Girth Planar Graphs Electronic Journal of Combinatorics. 15: 124. DOI: 10.37236/848 |
0.429 |
|
Show low-probability matches. |