Publications & Preprints

This list is roughly organized by subject. Alternatively one can view it in chronological order.

*Authors in pure math papers are listed in alphabetical order by convention. See the Culture Statement from the American Mathematical Society.

Extremal and Probabilistic Combinatorics

1. Toward Vu's conjecture, with Peter Bradshaw, Abhishek Methuku, and Michael C. Wigal. Preprint (submitted).

2. Balanced colorings of Erdös-Rényi hypergraphs, with Yuzhou Wang. Preprint (submitted).

3. Coloring locally sparse graphs, with James Anderson and Aiya Kuchukova. Preprint (submitted).

4. Bounds for the independence and chromatic numbers of locally sparse graphs. Annals of Combinatorics (2025).

5. Coloring graphs with forbidden almost bipartite subgraphs, with James Anderson and Anton Bernshteyn. Random Structures and Algorithms (2025).

6. List colorings of k-partite k-graphs. Electronic Journal of Combinatorics (2025).

7. Multigraph edge-coloring with local list sizes. Discrete Mathematics (2025).

8. Balanced independent sets and colorings of hypergraphs; Journal of Graph Theory (2025).

9. Borel Vizing's theorem for graphs of subexponential growth, with Anton Bernshteyn; Proceedings of the AMS (2025).

10. Coloring graphs with forbidden bipartite subgraphs, with James Anderson and Anton Bernshteyn; Combinatorics, Probability and Computing (2023). 

Graph Algorithms

1. A simple algorithm for near-Vizing edge-coloring in near-linear time. Preprint (submitted).

2. Palette sparsification for graphs with sparse neighborhoods. Preprint (submitted).

3. A linear-time algorithm for (1+ε)∆-edge-coloring, with Anton Bernshteyn. Preprint (submitted).

4. Fast algorithms for Vizing's theorem on bounded degree graphs, with Anton Bernshteyn. Journal of Combinatorial Theory, Series B (2025).

5. Fast and simple (1+ε)∆-edge-coloring of dense graphs. Theoretical Computer Science (2025).

6. Edge-coloring algorithms for bounded degree multigraphs; SODA (2024).

Average-Case Complexity Theory

1. Sharp online hardness for large balanced independent sets, with Eren C. Kızıldağ and Neeladri Maitra. Preprint (submitted).

2. The low-degree hardness of finding large independent sets in sparse random hypergraphs, with Yuzhou Wang. SIAM Journal on Discrete Mathematics (to appear).

Statistical Inference

1. Detection of dense subhypergraphs by low-degree polynomials, with Cheng Mao and Alexander S. Wein; Random Structures and Algorithms (2025). 

2. Sharp analysis of EM for learning mixtures of pairwise differences, with Cheng Mao and Ashwin Pananjady; COLT (2023).