Graph comparison meets Alexandrov
arXiv:2212.08016 · doi:10.1134/S0037446623030102
Abstract
Graph comparison is a certain type of condition on metric space encoded by a finite graph. We show that any nontrivial graph comparison implies one of Alexandrov's comparisons. The proof gives a complete description of graphs with trivial graph comparisons.
English+Russian, 7+7 pages, 11+11 figures