E-mail: alexandru.malekshahian at kcl dot ac dot uk
I am a PhD student at King's College London. My supervisor is Matthew Jenssen.
Starting in autumn 2025, I will be a postdoc in Oxford, supervised by Peter Keevash.
I mostly work in probabilistic combinatorics. I am also broadly interested in statistical mechanics, extremal combinatorics, Ramsey theory, combinatorial game theory and combinatorial limits.
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. A refined graph container lemma and applications to the hard-core model on bipartite expanders (with Matthew Jenssen and Jinyoung Park), submitted.
3. On a clique-building game of Erdős (with Sam Spiro), submitted.
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.