Emergent Mind
Determining triangulations and quadrangulations by boundary distances
(2111.13556)
Published Nov 26, 2021
in
math.CO
and
cs.DM
Abstract
We show that if a disc triangulation has all internal vertex degrees at least 6, then the full triangulation may be determined from the pairwise graph distance between boundary vertices. A similar result holds for quadrangulations with all internal degrees 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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.