1 citations · 1 across the 5 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2026
Rigidity of complements of bounded-degree graphs
John Haslegrave, Peleg Michaeli, Anthony Nixon
Maxwell observed that the graph of any rigid generic framework in on vertices has at least edges. In this article we prove that graphs whose…
math.CO2025
Sharp thresholds for NAC-colourings and stable cuts in random graphs
Katie Clinch, John Haslegrave, Tony Huynh +1
NAC-colourings of graphs correspond to flexible quasi-injective realisations in . A special class of NAC-colourings are those that arise from stable cuts. We give s…