Home > Research > Publications & Outputs > Determining triangulations and quadrangulations...

Associated organisational unit

Electronic data

  • triangulation-reconstruction-v2

    Accepted author manuscript, 297 KB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

Links

Text available via DOI:

View graph of relations

Determining triangulations and quadrangulations by boundary distances

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published
<mark>Journal publication date</mark>30/11/2023
<mark>Journal</mark>Journal of Combinatorial Theory, Series B
Volume163
Number of pages23
Pages (from-to)233-255
Publication StatusPublished
Early online date31/08/23
<mark>Original language</mark>English

Abstract

We show that if all internal vertices of a disc triangulation have degree at least 6, then the full structure can be determined from the pairwise graph distances between boundary vertices. A similar result holds for disc quadrangulations with all internal vertices having degree at least 4. This confirms a conjecture of Itai Benjamini. Both degree bounds are best possible, and correspond to local non-positive curvature. However, we show that a natural conjecture for a “mixed” version of the two results is not true.