My main areas of research are in extremal and probabilistic combinatorics with implications in theoretical computer science. Some particular topics I am interested in are: independent sets and colorings of graphs and hypergraphs, average-case complexity theory, and statistical inference on random (hyper)graphs.
My Erdős number is 3.
Below is a list of selected publications and preprints. See here for a full list of my work organized in chronological order. Alternatively, see here for a list organized by subject.
*Authors in pure math papers are listed in alphabetical order by convention. See the Culture Statement from the American Mathematical Society.
Independent sets and colorings of K_{t,t,t}-free graphs, with Oliver Janzer and Abhishek Methuku. Preprint (submitted). [arxiv]
Sharp online hardness for large balanced independent sets, with Eren C. Kızıldağ and Neeladri Maitra. Preprint (submitted). [arxiv]
Toward Vu's conjecture, with Peter Bradshaw, Abhishek Methuku, and Michael C. Wigal. Preprint (submitted). [arxiv]
A linear-time algorithm for (1+ε)∆-edge-coloring, with Anton Bernshteyn. Preprint (submitted). [arxiv]
The low-degree hardness of finding large independent sets in sparse random hypergraphs, with Yuzhou Wang. SIAM Journal on Discrete Mathematics (to appear). [arxiv]
Bounds for the independence and chromatic numbers of locally sparse graphs. Annals of Combinatorics (2025). [arxiv | journal]
Fast algorithms for Vizing's theorem on bounded degree graphs, with Anton Bernshteyn. Journal of Combinatorial Theory, Series B (2025). [arxiv | journal]
Coloring graphs with forbidden almost bipartite subgraphs, with James Anderson and Anton Bernshteyn. Random Structures and Algorithms (2025). [arxiv | journal]
Detection of dense subhypergraphs by low-degree polynomials, with Cheng Mao and Alexander S. Wein; Random Structures and Algorithms (2025). [arxiv | journal]
Edge-coloring algorithms for bounded degree multigraphs; SODA (2024). [arxiv | journal]