Embedded Files
E-mail: alex.malekshahian@maths.ox.ac.uk
I am a Postdoctoral Research Associate at the University of Oxford, working with Peter Keevash.
Prior to this, I was a PhD student at King's College London, where I was supervised by Matthew Jenssen.
I mostly work in probabilistic combinatorics. I am also broadly interested in statistical mechanics, extremal combinatorics, Ramsey theory, combinatorial game theory and combinatorial limits.
Publications and preprints
Publications and preprints
7. A linear upper bound for zero-sum Ramsey numbers of bounded degree graphs (with Jasmin Katz, Xiaopan Lian and Andrey Shapiro), preprint.
6. Leaf-to-leaf paths and cycles in degree-critical graphs (with Kyriakos Katsamaktsis, Francesco Di Braccio, Jie Ma and Ziyuan Zhao), submitted.
this extends the results of a previous preprint titled "Leaf-to-leaf paths of many lengths".
5. On Dedekind’s problem, a sparse version of Sperner’s theorem, and antichains of a given size in the Boolean lattice (with Matthew Jenssen and Jinyoung Park), submitted.
4. On a clique-building game of Erdős (with Sam Spiro), submitted.
3. A refined graph container lemma and applications to the hard-core model on bipartite expanders (with Matthew Jenssen and Jinyoung Park)
Random Structures & Algorithms, to appear.
2. The dimension of the feasible region of pattern densities (with Frederik Garbe, Dan Kráľ and Raul Penaguiao)
Mathematical Proceedings of the Cambridge Philosophical Society 2025; 178(1):1-14.
an extended abstract appeared in the Proceedings of EUROCOMB’23.
1. Strategy stealing in triangle avoidance games, arXiv preprint.
Page updated
Google Sites
Report abuse