This list is in chronological order. Alternatively one can view it organized by subject.
*Authors in pure math papers are listed in alphabetical order by convention. See the Culture Statement from the American Mathematical Society.
Ramsey numbers of loose triangles versus cliques, with Ayush Basu and Abhishek Methuku. Preprint. [arxiv]
Fractional colorings of K_r-free graphs with local demands, with Ewan Davies, Abhishek Methuku, Huy Nguyen, and Jaehyeon Seo. Preprint (submitted). [arxiv]
Half-optimal induced matchings in random graphs: online and low-degree algorithms, with Eren C. Kızıldağ, Cheng Mao, Neeladri Maitra, and Timothy L. H. Wee. [arxiv]
Random independent sets in uncrowded hypergraphs, with Lina Li, Abhishek Methuku, Minh-Quan Vo, and Kewen Yuan. [arxiv]
Fractional DP-colorings of d-degenerate locally sparse graphs, with Huy Nguyen and Rohan Rathi. [arxiv]
List coloring uncrowded hypergraphs at the shattering threshold, with Abhishek Methuku and Minh-Quan Vo. [arxiv]
Sharp bounds for the fractional chromatic number of high girth d-degenerate graphs, with Peter Allen and Jonathan A. Noel. [arxiv]
Fractional coloring via entropy. [arxiv]
The strong chromatic index of K_{t,t}-free graphs, with Richard Bi, Peter Bradshaw, and Jingwei Xu. [arxiv]
Choosability of multipartite hypergraphs, with Peter Bradshaw, Nhi U. Dinh, Shlok Mulye, and Rohan Rathi. [arxiv]
Independent sets and colorings of K_{t,t,t}-free graphs, with Oliver Janzer and Abhishek Methuku. [arxiv]
Sharp online hardness for large balanced independent sets, with Eren C. Kızıldağ and Neeladri Maitra. [arxiv]
Balanced colorings of Erdős-Rényi hypergraphs, with Yuzhou Wang. [arxiv]
Toward Vu's conjecture on coloring graphs of bounded codegree, with Peter Bradshaw, Abhishek Methuku, and Michael C. Wigal. Journal of Combinatorial Theory, Series B (to appear). [arxiv]
Palette sparsification for graphs with sparse neighborhoods. Discrete Mathematics (2027). [arxiv | journal]
A linear-time algorithm for (1+ε)∆-edge-coloring, with Anton Bernshteyn. SIAM Journal on Discrete Mathematics (2026). [arxiv | journal]
A simple algorithm for near-Vizing edge-coloring in near-linear time. Information Processing Letters (2026). [arxiv | journal]
The low-degree hardness of finding large independent sets in sparse random hypergraphs, with Yuzhou Wang. SIAM Journal on Discrete Mathematics (2026). [arxiv | journal]
Coloring locally sparse graphs, with James Anderson and Aiya Kuchukova. Electronic Journal of Combinatorics (2026). [arxiv | journal]
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]
List colorings of k-partite k-graphs. Electronic Journal of Combinatorics (2025). [arxiv | journal]
Fast and simple (1+ε)∆-edge-coloring of dense graphs. Theoretical Computer Science (2025). [arxiv | journal]
Multigraph edge-coloring with local list sizes. Discrete Mathematics (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]
Balanced independent sets and colorings of hypergraphs. Journal of Graph Theory (2025). [arxiv | journal]
Borel Vizing's theorem for graphs of subexponential growth, with Anton Bernshteyn. Proceedings of the AMS (2025). [arxiv | journal]
Coloring graphs with forbidden bipartite subgraphs, with James Anderson and Anton Bernshteyn. Combinatorics, Probability and Computing (2023). [arxiv | journal]
The independence number of uncrowded hypergraphs: bounds matching the shattering threshold, with Abhishek Methuku and Minh-Quan Vo. SODA (2027; to appear). [arxiv]
Algorithmic phase transition for large independent sets in dense hypergraphs, with Nhi U. Dinh, Eren C. Kızıldağ, Neeladri Maitra, and Bayram A. Şahin. RANDOM (2026). [arxiv | conference]
Edge-coloring algorithms for bounded degree multigraphs. SODA (2024). [arxiv | conference]
Sharp analysis of EM for learning mixtures of pairwise differences, with Cheng Mao and Ashwin Pananjady. COLT (2023). [arxiv | conference]