Selected Research Papers
+ Set-coloring Ramsey numbers via codes (with D. Conlon. J. Fox, X. He, D. Mubayi, A. Suk), To appear in Studia Scientiarum Mathematicarum Hungarica: Combinatorics, Geometry and Topology, (2023).
+ Coloring unions of nearly disjoint hypergraph cliques (with D. Mubayi) To appear in Mathematika, (2023).
+ The asymptotics of r(4,t) (with S. Mattheus) 17 pages. To appear in the Annals of Mathematics, (2023).
+ A note on pseudorandom Ramsey graphs (with D. Mubayi) Journal of the European Mathematical Society, (2023).
+ Notes on pseudorandom Ramsey graphs, with exercises, (2023).
+ Extremal problems for hypergraph blowups of trees (with Z. Furedi, T. Jiang, A. Kostochka, D. Mubayi), (2023).
​+ Hypergraph Ramsey numbers of cliques versus stars (with D. Conlon, J. Fox, X. He, D. Mubayi, A. Suk) Random Structures and Algorithms (2023), 1–14.
​+ Extremal problems for pairs of triangles in a convex polygon. (with Z. Füredi, D. Mubayi, J. O'Neill). J. Combin. Theory Ser. B 155 (2022), 83–110.
+ Ramsey numbers for nontrivial Berge cycles (with J. Nie). SIAM J. Discrete Math. 36 (2022), no. 1, 103–113.
+ Tight paths in convex geometric hypergraphs (with Z. Füredi, T. Jiang, A. Kostochka, D. Mubayi) Advances in Combinatorics, 2020, Paper No. 1, 14 pp.
​+ On asymptotic packing of geometric graphs (with D. Cranston, J. Nie, A. Wesolek). Discrete Appl. Math. 322 (2022), 142–152.
​+ Counting hypergraphs with large girth (with S. Spiro), J. Graph Theory 100 (2022), no. 3, 543–558.
+ A note on k-wise oddtown problems (with J. O'Neill), Graphs Combin. 38 (2022), no. 3, Paper No. 101, 12 pp.
+ Extremal problems for convex geometric hypergraphs and ordered hypergraphs (with Z. Füredi, T. Jiang, A. Kostochka, D. Mubayi). Canad. J. Math. 73 (2021), no. 6, 1648–1666.
+ Relative Turan Numbers for Hypergraph Cycles (with S. Spiro), Discrete Mathematics, 344 no. 10, (2021), 112-542.
+ Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth (with Jiaxi Nie), Random Structures & Algorithms 59.1 (2021), 79-95.
​
+ Relative Turan Problems for Uniform Hypergraphs (with S. Spiro), SIAM Journal of Discrete Mathematics, 35, no. 3, (2021), 2170-2191.
​​
+ Triangle-Free Subgraphs of Hypergraphs (with Jiaxi Nie and S. Spiro), Graphs and Combinatorics 37 (2021), 2555-2570.
+ Non-trivial d-wise intersecting families (with J. O'Neill) Journal of Combinatorial Theory, Series A 178 (2021), 10pp.
+ Ordered and convex geometric trees with linear extremal function. Discrete and Computational Geometry, 64 (2020), no. 2, 324–338.
+ Partitioning ordered hypergraphs. (with Z. Füredi, T. Jiang, A. Kostochka, D. Mubayi) Journal of Combinatorial Theory, Series A 177 (2021).
+ Hypergraphs not containing a tree with a bounded trunk II: 3-trees with a trunk of size 2. Discrete Applied Mathematics, 276 (2020), 50–59.
+ Hypergraphs not containing a tree with a bounded trunk I. SIAM Journal of Discrete Mathematics, 33 (2019), no. 2, 862–873.
+ Stability in the Erdos-Gallai Theorem on paths II (with Z. Füredi, A. Kostochka, R. Luo)
+ Stability in the Erdos-Gallai Theorem on cycles and paths (with Z. Füredi, A. Kostochka) Journal of Combinatorial Theory Series B, 121 (2016), 197-228.
​+ Counting trees in graphs (with D. Mubayi) Electronic Journal of Combinatorics 23 (3) (2016), #P3.39.
+ Graphs without theta subgraphs (with J. Williford) Journal of Combinatorial Theory Series B,134 (2019), 76–87.
+ Full subgraphs (with V. Falgas-Ravry, K. Markstrom) Journal of Graph Theory, Vol. 88, (3), 411-427.
+ The extremal function for cycles of length l mod k (with B. Sudakov) Electronic Journal of Combinatorics 24 (2017), P1-7.
+ Cycles in triangle-free graphs of large chromatic number (with A. Kostochka, B. Sudakov) Combinatorica. 37 (2017), 481-494.
+ Turán Numbers and Shadows II: Trees (joint with A. Kostochka, D. Mubayi) Journal of Combinatorial Theory Series B, 122 (2017), 457-478.
+ On sets of integers with restrictions on products (with M. Tait) European Journal of Combinatorics, 51 (2016) 268-274.
+ A survey of Turán problems for expansions (with D. Mubayi) Recent Trends in Combinatorics, IMA Volumes in Mathematics and its Applications 159. Springer, New York, 2015. Vii 706. ISBN: 978-3-319-24296-5.
+ Extremal problems for cycles in graphs. Recent Trends in Combinatorics, IMA Volumes in Mathematics and its Applications 159. Springer, New York, 2015. Vii 706. ISBN: 978-3-319-24296-5.
+ A counterexample to sparse removal (with C. Timmons) European Journal of Combinatorics, 44 (A) (2015), 77-86.
+ Asymptotic improvement of the Gilbert-Varshamov bound on the size of permutation codes (with M. Tait, A. Vardy) Manuscipt
+ Probabilistic constructions in generalized quadrangles (with J. Schillewaert). Discrete Mathematics, 338 no. 6, (2015), 1000-1010.
+ Turán Numbers and Shadows III: Expansions of graphs (joint with A. Kostochka, D. Mubayi) SIAM Journal on Discrete Mathematics 29 (2015), no. 2, 868-876.
+ Turán Numbers and Shadows I: Paths and Cycles (joint with A. Kostochka, D. Mubayi) Journal of Combinatorial Theory, Series A 129 (2015), 57-79.
+ Turán Numbers of bipartite graphs plus an odd cycle (with P. Allen, P. Keevash, B. Sudakov) Journal of Combinatorial Theory Series B, 106 (2014), 134-162.
+ On coupon colorings of graphs (with B. Chen, J H Kim, M. Tait) Discrete Applied Mathematics 193 (2015) 94--101.
+ On the independence number of Steiner systems (with A. Eustis) Combinatorics, Probability and Computing, 22 no. 2 (2013), 241-252.
+ Hypergraph Ramsey Numbers : Triangles versus cliques (with A. Kostochka, D. Mubayi) Journal of Combinatorial Theory, Series A 120 (2013), no. 7, 1491-1507.
+ On a conjecture of Erdos and Simonovits: Even Cycles (with P. Keevash, B. Sudakov) Combinatorica 33 (2013), 699-732.
+ On independent sets in hypergraphs (with A. Kostochka, D. Mubayi) Random Structures and Algorithms 44 no. 2, (2014), 224-239.
+ On even-degree subgraphs of hypergraphs (with D. Dellamonica, P. Haxell, T. Luczak, D. Mubayi, B. Nagle. V. Rodl, Y. Person, M. Schacht) Combinatorics, Probability and Computing 21 no. 1-2, (2012), 113-127.
+ List coloring hypergraphs (with P. Haxell) Electronic Journal of Combinatorics Volume 17 no 1. (2010) 12 pages (electronic).
+ Large incidence-free sets in rank two geometries (with S. de Winter and J. Schillewaert) Electronic Journal of Combinatorics 19, No. 4, (2012), pp. 16.
+ On the threshold for k-regular subgraphs of random graphs (with P. Pralat, N. Wormald) Combinatorica 31 (2011), 565-581.
+ The Erdõs-de Bruijn Theorem for hypergraphs (with N. Alon, K. Mellinger, D. Mubayi) Designs, Codes and Cryptography, 65, (2012) no. , 233-245.
​
+ Cycles in graphs with large independence ratio (with B. Sudakov) Journal of Combinatorics, 2 (2011), 82-102.
+ On decompositions of complete hypergraphs (with S. Cioaba, A. Kündgen) Journal of Combinatorial Theory Series A, 116 (2009), no. 7, 1232--1234.
+ The maximum size of hypergraphs without generalized 4-cycles (with O. Pikhurko) Journal of Combinatorial Theory Series A, 116 (2009), no. 3, 637--649.
+ Two regular subgraphs of hypergraphs (with D. Mubayi) Journal of Combinatorial Theory Series B, 99 (2009), no. 3, 643--655.
+ On dissemination thresholds in regular and irregular graph classes (with I. Rapaport, K. Suchan, I. Todinka) LATIN 2008: Theoretical informatics, 24-35, Lecture Notes in Comput. Sci., 4957, Springer, Berlin, 2008.
+ Cycle lengths in sparse graphs (with B. Sudakov) Combinatorica 28 (2008), 357-372. Erratum to this paper.
+ An extremal characterisation of projective planes (with F. Lazebnik and S. de Winter) Electronic Journal of Combinatorics, 15 (2008), no. 1, Research Paper 143, 13 pp.
+ A note on polynomicals and f-factors of graphs (with H. Shirazi) Electronic Journal of Combinatorics, 15 (2008) no 1, Note 22, 5 pp.
+ Clique partitions of complements of forests and bounded degree graphs (with M. Cavers) Discrete Mathematics 308 (2008) no. 10, 2011-2017.
​
+ Minimal Paths and Cycles in Set Systems (with D. Mubayi) European Journal of Combinatorics, 28 (2007), no. 6, 1681-1693.
​
+ Rainbow Turán Problems (with D. Mubayi, P. Keevash, B. Sudakov) Combinatorics, Probability and Computing, 16 (2007), no. 1, 109-126.
​
+ Rainbow Turán Problems (with D. Mubayi, P. Keevash, B. Sudakov) Combinatorics, Probability and Computing, 16 (2007), no. 1, 109-126. Erratum.
+ Independent dominating sets and hamiltonian cycles (with P. Haxell, B. Seamone) Journal of Graph Theory, 54 (2007), no. 3, 233-244.
+ Approximation algorithms & hardness for cycle packing problems (with Michael Krivelevich, Mohammad Salavatipour, Raphy Yuster, Uri Zwick) ACM Trans. Algorithms 3 (2007), no. 4, Art. 48, 21 pp.
+ On the Turán number for the hexagon (with Zoltan Füredi, Assaf Naor) Advances in Mathematics, 203 (2006), (2), 476-496.
+ Cycles in planar graphs Special issue of Utilitas Mathematica in honour of Professor Henda Swart, 69 (2006), 109-117.
+ Product representations of polynomials. European Journal of Combinatorics, Volume 27, Issue 8, November 2006, Pages 1350-1361.
+ Regular Subgraphs of Random Graphs (with B. Bollobás, J H Kim) Random Structures Algorithms 29 (2006), no. 1, 1-13.
+ Parity check matrices and product representation of squares (with A. Naor) Combinatorica 28 (2008) no. 2, 163-185. Proceedings ISIT Conference, Adelaide, Australia, September 2005.
+ Disjoint cycles: integrality gap, hardness, and approximation (with M. Salavatipour) Integer programming and combinatorial optimization (IPCO), Lecture Notes in Comput. Sci, 3509, Springer, Berlin, (2005), 51-65.
+ A note on bipartite graphs without 2k-cycles (with A. Naor) Combinatorics, Probability and Computing, 14 (2005), (5-6) 845-849.
+ Unavoidable cycle lengths in graphs Journal of Graph Theory, 49 (2005), no. 2, 151-167.
+ Even cycles in hypergraphs (with A. Kostochka) Journal of Combinatorial Theory Series B, 94 (2005), no. 1, 173-182.
+ On the number of sets of cycle lengths Combinatorica, 24 (2004), no. 4, 719-730.
+ Multicolor Turán problems (with P. Keevash, M. Saks, B. Sudakov) Advances in Applied Mathematics, 33 (2004), no. 2, 238-262.
+ On hypergraphs of girth five (with F. Lazebnik). Electronic Journal of Combinatorics, 10 (2003), Research Paper 25, 15 pp.
+ Proof of a conjecture of Erdõs on triangles in set-systems (with D. Mubayi) Combinatorica, 25 (2005), no. 5, 599-614.
+ A Note on graphs without short even cycles (with T. Lam) Electronic Journal of Combinatorics, Volume 12 (2005).
+ A hypergraph extension of the bipartite Turán problem (with D. Mubayi) Journal of Combinatorial Theory Series A, 106 (2004), no. 2, 237-253.
+ Vertex-disjoint cycles of the same length. Journal of Combinatorial Theory Series B, 88 (2003), no. 1, 45-52.
+ A note on vertex-disjoint cycles. Combinatorics, Probability and Computing, 11 (2002), no. 1, 97-102.
+ Disjoint subgraphs of graphs (Manuscript)
+ On arithmetic progressions of cycle lengths in graphs Combinatorics, Probability and Computing, 9 (2000), no. 4, 369-373.
​
+ Independent dominating sets in graphs of girth five (with A. Harutyunyan, P. Horn), Combinatorics, Probability and Computing, 30 no. 3, (2021), 344--359.
