Research

Publications and Preprints:

[13] The number of colorings of the middle layers of the Hamming cube (with Gwen McKinley, and Jinyoung Park), submitted.

[12] On generalized Ramsey numbers in the non-integral regime (with Patrick Bennett, Michelle Delcourt, and Luke Postle), submitted.  

[11] The chromatic number of triangle-free hypergraphs (with Luke Postle), submitted.  

[10] Intersecting families of sets are typically trivial (with J. Balogh, R. I. Garcia, and Adam Zsolt Wagner), to appear in Journal of Combinatorial Theory, Series B.

[9]  Generalized Rainbow Turán Numbers of Odd Cycles (with J. Balogh, Michelle Delcourt, and Emily Heath), Discrete Mathematics, 345.2(2022): 112663. 

[8]  Tilings in vertex ordered graphs (with J. Balogh and Andrew Treglown), Journal of Combinatorial Theory, Series B, 155 (2022): 171-201.

[7]  Independent sets in the middle two layers of Boolean lattice (with J. Balogh and Ramon I. Garcia),  Journal of Combinatorial Theory, Series A, 178 (2021), 105341.

[6]  On the maximum number of integer colorings with forbidden rainbow sums (with Yangyang Cheng, Yifan Jing, Guanghui Wang, and Wenling Zhou), Journal of Combinatorial Theory, Series A, 199 (2023): 105769

[5]  An analogue of the Erdős-Gallai theorem for random graphs (with J. Balogh, and Andrzej Dudek), European Journal of Combinatorics, 91(2021), 103200.

[4]  The typical structure of Gallai colorings and their extremal graphs (with J. Balogh), SIAM Journal on Discrete Mathematics, 33 (2019), No. 4, 2416--2443.

[3]  Cyclic triangle factors in regular tournaments (with Theodore Molla),  Electronic Journal of Combinatorics, 26 (2019), No. 4, P4.24.

[2]  On the number of generalized Sidon sets (with J. Balogh), ACTA Scientiarum Mathematicarum (Szeged), 87.1 (2021): 3-21.

[1]  On the number of linear hypergraphs of large girth (with József  Balogh), Journal of Graph Theory, 93 (2020), No. 1, 113--141.

Activities: 

Invited Talks:

    The chromatic number of triangle-free hypergraphs

    The chromatic number of triangle-free hypergraphs

The chromatic number of graphs and hypergraphs

    The chromatic number of triangle-free hypergraphs

      Intersecting families of sets are typically trivial     

Intersecting families of sets are typically trivial

Intersecting families of sets are typically trivial

Tilings in vertex ordered graphs

Tilings in vertex ordered graphs


Intersecting families of sets are typically trivial

     Tilings in vertex ordered graphs

     Tilings in vertex ordered graphs

Rainbow Erdős-Rothschild problem for sum-free sets

Counting independent sets in middle two layers of Boolean lattice

Counting independent sets in middle two layers of Boolean lattice

       Erdős-Rothschild problems and their rainbow variants

      Erdős-Rothschild problems and their rainbow variants

         On the number of generalized Sidon sets & graphs with a few short cycles

          An overview of Erdős-Rothschild problems and their rainbow variants

         An overview of Erdős-Rothschild problems and their rainbow variants

        The typical structure of Gallai colorings and their extremal graphs (Talk slides)

       The typical structure of Gallai colorings and their extremal graphs       


Contributed Talks:

       The typical structure of Gallai colorings and their extremal graphs 

       Polynomial to exponential transition in hypergraph Ramsey theory

       The typical structure of Gallai colorings

       The typical structure of Gallai colorings    

     On the number of linear hypergraphs of large girth