J. Haslegrave

activity

20242026

collaborators

3 papers

math.CO2026

Stable cuts, NAC-colourings and flexible realisations of graphs

Katie Clinch, DÃ¡niel GaramvÃ¶lgyi, John Haslegrave +3

A (2-dimensional) realisation of a graph $G$ is a pair $(G, p)$ , where $p$ maps the vertices of $G$ to $R^{2}$ . A realisation is flexible if it can be continuously deformed w…

math.PR2025

Competing types in preferential attachment graphs with community structure

John Haslegrave, Jonathan Jordan, Mark Yarrow

We extend the two-type preferential attachment model of AntunoviÄ, Mossel and RÃ¡cz, where each new vertex takes its type according to a defined rule based on the types of its nei…

math.PR2024

Random triangulations of the d-sphere with minimum volume

Agelos Georgakopoulos, John Haslegrave, Joel Larsson Danielsson

We study a higher-dimensional analogue of the {Random Travelling Salesman Problem}: let the complete $d$ -dimensional simplicial complex $K_{n}^{d}$ on $n$ vertices be equipped with i…