Publications
Publications
A note on finding large transversals efficiently (with Patrick Morris), accepted at Journal of Combinatorial Designs.
Extremal, enumerative and probabilistic results on ordered hypergraph matchings (with Zhihan Jin, Matthew Kwan, and Benny Sudakov), Forum Math. Sigma, 13 (2025).
The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs (with Yahav Alon), Random Structures & Algorithms, 66(2) (2025).
On the chromatic number of powers of subdivisions of graphs (with Simona Boyadzhiyska, Silas Rathke, Juanjo Rué), Journal of Discrete Applied Mathematics, 360: 506–511 (2025).
Climbing up a random subgraph of the hypercube (with Diskin Sahar, Elboim Dor, and Michael Krivelevich), Electronic Communications in Probability, 29 (2024).
Partitioning problems via random processes (with Oliver Cooley, Mihyun Kang and Matthew Kwan), Journal of London Mathematical Society 110(2) (2024).
Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets (with David Fabian, Alp Müyesser and Tibor Szabó), The Electronic Journal of Combinatorics (2023): P3-10.
A Note on Long Cycles in Sparse Random Graphs, The Electronic Journal of Combinatorics (2023): P2-21.
A scaling limit for the length of the longest cycle in a sparse random digraph (with Alan Frieze) Random Structures & Algorithms 60.1: 3-24 (2022).
Hamiltonicity of random graphs in the stochastic block model, (with Alan Frieze and Pu Gao), SIAM Journal on Discrete Mathematics 35.3: 1854-1880 (2021).
Majority Colorings of Sparse Digraphs (with Ander Lamaison, Raphael Steiner, Tibor Szabó), Electron. J. Comb. 28(2) (2021).
Finding perfect matchings in random regular graphs in linear time (with Alan Frieze) Random Structures & Algorithms 58(3): 390-429 (2021).
A scaling limit for the length of the longest cycle in a sparse random graph (with Alan Frieze) J. Comb. Theory, Ser. B 148: 184-208 (2021).
A Ramsey property of random regular and k -out graphs (with Deepak Bal), J. Graph Theory 93(3): 363-371 (2020).
Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis (with Alan Frieze), Random Structures & Algorithms 57(4): 865-878 (2020).
On the connectivity threshold for colorings of random graphs and hypergraphs, (with Alan Frieze) Random Structures & Algorithms 56(4): 988–997 (2020).
How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected? (with Alan Frieze) J. Graph Theory 92(4): 405-414 (2019).
Pattern Colored Hamilton Cycles in Random Graphs (with Alan Frieze), SIAM J. Discret. Math. 33(1): 528-545 (2019).
Constraining the clustering transition for colorings of sparse random graphs (with Alan Frieze and Wesley Pegden), Electron. J. Comb. 25(1): P1.72 (2018).
Connectivity of the k-out Hypercube SIAM J. Discret. Math. 32(3): 2194-2216 (2018).
Packing Directed and Hamilton Cycles Online (with Joseph Briggs), SIAM J. Discret. Math. 32(2): 1505-1539 (2018).
Randomly coloring simple hypergraphs with fewer colors (with Alan Frieze), Inf. Process. Lett. 126: 39-42 (2017).
Smoothed analysis for graph isomorphism (with Matthew Kwan and Ben Moore), accepted at 57th ACM Symposium on Theory of Computing (STOC 2025).
The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging' (with \item M. Anastos, B. Auerbach, M.A Baig, M.C Noval, M Kwan, G. Pascual-Perez, and K Pietrzak), Theory of Cryptography. TCC 2024. Lecture Notes in Computer Science, vol 15364. Springer, Cham.
Fast algorithms for solving the Hamilton Cycle problem with high probability. Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
Constructing Hamilton cycles and perfect matchings efficiently. In proceedings of European Conference on Combinatorics, Graph Theory and Applications (2023) (EUROCOMB).
Solving the Hamilton Cycle problem fast on average. 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2022.
Thresholds in Random Motif Graphs (with Peleg Michaeli and Sam Petti), Proceedings of APPROX-RANDOM. 2019.
On the connectivity threshold for colorings of random graphs and hypergraphs (with Alan Frieze), Proceedings of APPROX-RANDOM. 2019.
Manuscripts:
Spanning trees of bounded degree in random geometric graphs (with Sahar Diskin, Dawid Ignasiak, Lyuben Lichev and Yetong Sha), preprint available as arXiv: 2505.16818.
Nearly spanning cycle in the percolated hypercube (with Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich, and Lyuben Lichev), preprint available as arXiv:2503.14336.
The law of the circumference of sparse binomial random graphs (with Joshua Erde, Mihyun Kang, and Vincent Pfenninger), preprint available as arXiv:2503.14336.
Robust Hamiltonicity in families of Dirac graphs (with Debsoumya Chakraborti), preprint available as arXiv:2309.12607.
An improved lower bound on the length of the longest cycle in random graphs, preprint available as arXiv:2208.06851.
Packing Hamilton Cycles in Cores of Random Graphs, preprint available as arXiv:2107.03527.
On a k-matching algorithm and finding k-factors in random graphs with minimum degree k+1 in linear time, preprint available as arXiv:2107.03523.
Purchasing a C_4 online, preprint available as arXiv:1611.07503, preprint available as arXiv:2503.14336.