My research interests are broadly related to graph theory. I am interested in extremal properties, algorithms, and random graph / hypergraph models.
*Authors in pure math papers are listed in alphabetical order by convention. See the Culture Statement from the American Mathematical Society.
Balanced colorings of Erdös-Rényi hypergraphs, with Yuzhou Wang.
Palette sparsification for graphs with sparse neighborhoods.
A simple algorithm for near-Vizing edge-coloring in near-linear time.
A linear-time algorithm for (1+ε)∆-edge-coloring, with Anton Bernshteyn.
The low-degree hardness of finding large independent sets in sparse random hypergraphs, with Yuzhou Wang.
Coloring locally sparse graphs, with James Anderson and Aiya Kuchukova.
Bounds on the independence and chromatic numbers of locally sparse graphs. Annals of Combinatorics (2025).
Fast algorithms for Vizing's theorem on bounded degree graphs, with Anton Bernshteyn. Journal of Combinatorial Theory, Series B (2025).
Coloring graphs with forbidden almost bipartite subgraphs, with James Anderson and Anton Bernshteyn. Random Structures and Algorithms (2025).
List colorings of k-partite k-graphs. Electronic Journal of Combinatorics (2025).
Fast and simple (1+ε)∆-edge-coloring of dense graphs. Theoretical Computer Science (2025).
Multigraph edge-coloring with local list sizes. Discrete Mathematics (2025).
Detection of dense subhypergraphs by low-degree polynomials, with Cheng Mao and Alexander S. Wein; Random Structures and Algorithms (2025).
Balanced independent sets and colorings of hypergraphs; Journal of Graph Theory (2025).
Borel Vizing's theorem for graphs of subexponential growth, with Anton Bernshteyn; Proceedings of the AMS (2025).
Coloring graphs with forbidden bipartite subgraphs, with James Anderson and Anton Bernshteyn; Combinatorics, Probability and Computing (2023).
Edge-coloring algorithms for bounded degree multigraphs; SODA (2024).
Sharp analysis of EM for learning mixtures of pairwise differences, with Cheng Mao and Ashwin Pananjady; COLT (2023).