1 citations · 1 across the 9 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
math.CO2026
The number of realisations of a random graph
Sean Dewar, Anthony Nixon, Ben Smith
Determining the number of realisations, up to isometries, of a graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we prove t…
math.CO2026
The -dimensional realisation number of a rigid graph
Sean Dewar, Anthony Nixon, Ben Smith
Determining the number of (complex) realisations of a rigid graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we provide tw…
math.CO2026
A counter-example to Baranyai's combinatorial characterisation for 3-rigidity
Sean Dewar
Recently Baranyai described a necessary combinatorial characterisation of graph rigidity for dimension 3. In this short note we provide a counter-example to the converse of the con…