  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.
