论文标题
图表比较符合Alexandrov
Graph comparison meets Alexandrov
论文作者
论文摘要
图比较是通过有限图编码的度量空间上的某种类型的条件。我们表明，任何非平凡的图形比较都意味着Alexandrov的比较之一。证明提供了图形的完整描述，并具有琐碎的图形比较。
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.
