## Articles

- D. Grósz, A. Methuku, and C. Tompkins. An upper bound on the size of diamond- free families of sets. arXiv:1601.06332, to appear in Journal of Combinatorial Theory
Series A.
- A. Davoodi, E. Győri, A. Methuku, C. Tompkins. An Erdős-Gallai type theorem for hypergraphs. arXiv:1608.03241, European Journal of Combinatorics 69, 159-162, 2018.
- D. Gerbner, A. Methuku, C. Tompkins. Intersecting P-free families. Journal of Combinatorial Theory, Series A 151, 61-83, 2017.
- P. Aboulker, G. Lagarde, D. Malec, A. Methuku, C. Tompkins. De Bruijn-Erdős type theorems for graphs and posets. Discrete Mathematics 340 (5) 995-999, 2017.
- D. Grósz, A. Methuku, and C. Tompkins. An improvement of the general bound on the largest family of subsets avoiding a subposet. Order 34, 113-125, 2016.
- A. Methuku and C. Tompkins. Exact forbidden subposet results using chain decompositions of the cycle. The Electronic Journal of Combinatorics, 22(4), 2015.
- E. Győri, S. Kensell, C. Tompkins. Making a C6-free graph C4-free and bipartite. Discrete Applied Mathematics 209, 133-136, 2015.
- E. Győri, G. Katona, L. Papp, C. Tompkins. The optimal pebbling number of staircase graphs. arXiv:1611.09686, submitted.
- D. Grósz, A. Methuku, and C. Tompkins. On subgraphs of C2k-free graphs and a problem of Kühn and Osthus. arXiv:1708.05454, submitted.
- E. Győri, D. Kórandi, A. Methuku, I. Tomon, C. Tompkins, M. Vizer. On the Turán number of some ordered even cycles. arXiv:1710.07664, submitted.
- C. Tompkins, Y. Wang. On an extremal problem involving a pair of forbidden posets. arXiv:1710.10760, submitted.
- M. Ferrara, D. Johnston, S. Loeb, F. Pfender, A. Schulte, H. Smith, E. Sullivan,M. Tait, C. Tompkins. On Edge-Colored Saturation Problems. arXiv:1712.00163,
submitted.
- N. Salia, C. Tompkins, O. Zamora. An Erdős-Gallai type theorem for vertexcolored graphs arXiv:1712.04388, submitted.

## Peer-reviewed conference proceedings

## PhD Dissertation