Abstract
Graph comparison is a certain type of condition on the metric space encoded by a finite graph. We show that each nontrivial graph comparison implies one of Alexandrov’s comparisons. The proof gives a complete description of graphs with trivial graph comparisons.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have