@article{19608d8d950148b79f349262f0ce3a38,
title = "Graph Comparison Meets Alexandrov",
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{\textquoteright}s comparisons.The proof gives a complete description of graphs with trivial graph comparisons.",
author = "Lebedeva, {N. D.} and Petrunin, {A. M.}",
note = "Funding Information: The first author was partially supported by the Russian Foundation for Basic Research (Grant no. 20–01–00070); the second author was partially supported by the National Science Foundation (Grant no. DMS–2005279) and the Ministry of Science and Higher Education of the Russian Federation (Grant no. 075–15–2022–289). Publisher Copyright: {\textcopyright} 2023, Pleiades Publishing, Ltd.",
year = "2023",
month = may,
doi = "10.1134/S0037446623030102",
language = "English (US)",
volume = "64",
pages = "624--628",
journal = "Siberian Mathematical Journal",
issn = "0037-4466",
publisher = "Pleiades Publishing",
number = "3",
}