6 papers
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…
Generalised Erdős distance theory on graphs
Sean Dewar, Nora Frankl, Samuel Mansfield +3
The famous Erdős distinct distances problem asks the following: how many distinct distances must exist between a set of points in the plane? There are many generalisations of t…
A tropical approach to rigidity: counting realisations of frameworks
Oliver Clarke, Sean Dewar, Daniel Green Tripp +4
A realisation of a graph in the plane as a bar-joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these f…
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 is a pair , where maps the vertices of to . A realisation is flexible if it can be continuously deformed w…
The -fold circuit property for matroids
Bill Jackson, Anthony Nixon, Ben Smith
Double circuits were introduced by Lovász in 1980 as a fundamental tool in his derivation of a min-max formula for the size of a maximum matching in linear matroids. This formula w…
Triangulated spheres with holes in triangulated surfaces
Katie Clinch, Sean Dewar, Niloufar Fuladi +6
Let denote a sphere with holes. Given a triangulation of a surface , we consider the question of when contains a spanning subgraph such t…