Alp Müyesser

Titchmarsh Research Fellow  ·  Mathematical Institute, University of Oxford

alp.muyesser@new.ox.ac.uk

Google Scholar arXiv

I am a Titchmarsh Research Fellow at the Mathematical Institute, University of Oxford and a G.H. Hardy Junior Research Fellow at New College. I completed my PhD at the University College London in 2024 where I was supervised by Alexey Pokrovskiy. I'm broadly interested in probabilistic, extremal, and additive aspects of combinatorics, as well as interactions with group theory, graph theory, and theoretical computer science.

Here are some (incomplete) lecture notes on the absorption method based on a recent graduate course.

Selected publications by topic

View all publications →

Publications

• A proof of Andersen's rainbow path conjecture for large n with Candida Bowtell, Richard Montgomery, and Alexey Pokrovskiy
• Hamiltonicity of mildly pseudorandom regular graphs
• Robustness and hyperstability for the Erdős-Gallai theorem with Micha Christoph and Yuval Wigderson
• Dirac subgraphs of powers of cycles are Hamiltonian with Richard Land, Mathias Schacht, and Carl Schildkraut
• The Lovász conjecture holds for moderately dense Cayley graphsFOCS, 2026 with Benjamin Bedert, Nemanja Draganić, and Matías Pavez-Signé
• On the Graham-Sloane harmonious labelling conjecture Compositio Mathematica, to appear with Alexey Pokrovskiy
• On Graham's rearrangement conjecture over 𝔽₂ⁿ with Benjamin Bedert, Matija Bucić, Noah Kravitz, and Richard Montgomery (also mentioned in a Quanta article)
• New bounds for linear arboricity and related problemsJournal of the European Mathematical Society, to appear with Micha Christoph, Nemanja Draganić, António Girão, Eoin Hurley, and Lukas Michel
• Cycle-factors of regular graphs via entropyFOCS, 2025 with Micha Christoph, Nemanja Draganić, António Girão, Eoin Hurley, and Lukas Michel
• Cyclic subsets in regular Dirac graphs IMRN, 2025 with Nemanja Draganić and Peter Keevash
• Towards Graham's rearrangement conjecture via rainbow paths Advances in Mathematics, 2026 with Matija Bucić, Bryce Frederickson, Alexey Pokrovskiy, and Liana Yepremyan
• Random embeddings of bounded degree trees with optimal spread Combinatorics, Probability, and Computing, 2025 with Paul Bastide and Clément Legrand-Duchesne
• Topological minors in typical lifts with Matija Bucić, Micha Christoph, and Raphael Steiner
• Cycle type in Hall–Paige: A proof of the Friedlander–Gordon–Tannenbaum conjecture Forum of Mathematics, Sigma, 2026
• Spanning spheres in Dirac hypergraphs Combinatorica, 2025 with Freddie Illingworth, Richard Lang, Olaf Parczyk, and Amedeo Sgueglia
• Spanning trees in pseudorandom graphs via sorting networks Proceedings of the American Mathematical Society, 2025 with Joseph Hyde, Natasha Morrison, and Matías Pavez-Signé (also mentioned in a Quanta article)
• Approximate path decompositions of regular graphs Journal of the London Mathematical Society, 2025 with Richard Montgomery, Alexey Pokrovskiy, and Benny Sudakov
• A random Hall-Paige conjecture Inventiones Mathematicae, 2025 with Alexey Pokrovskiy
• Optimal spread for spanning subgraphs of Dirac hypergraphs Journal of Combinatorial Theory, Series B, 2024 with Tom Kelly and Alexey Pokrovskiy
• A general approach to transversal versions of Dirac-type theorems Bulletin of the London Mathematical Society, 2023 with Pranshu Gupta, Fabian Hamann, Olaf Parczyk, and Amedeo Sgueglia
• Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets Electronic Journal of Combinatorics, 2023 with Michael Anastos, David Fabian, and Tibor Szabó
• Unavoidable patterns in locally balanced colorings Combinatorics, Probability, and Computing, 2023 with Nina Kamčev
• Transversal factors and spanning trees Advances in Combinatorics, 2022 with Richard Montgomery and Yani Pehova
• On a colored Turán problem of Diwan and Mubayi Discrete Mathematics, 2022 with Ander Lamaison and Michael Tait
• Turán and Ramsey-type results for unavoidable subgraphs Journal of Graph Theory, 2022 with Michael Tait
• Colored unavoidable patterns and balanceable graphs Electronic Journal of Combinatorics, 2023 with Matt Bowen, Adriana Hansberg, and Amanda Montejano
• Finding unavoidable colorful patterns in multicolored graphs Electronic Journal of Combinatorics, 2020 with Matt Bowen and Ander Lamaison
• Combining imagination and heuristics to learn strategies that generalize Neurons, Behavior, Data Analysis, and Theory, 2020 with Kyle Dunovan, Erik Peterson and Timothy Verstynen
• The Sprague-Grundy function for some selective compound games Integers, 2020 with Calvin Beideman and Matt Bowen