Metric graphs of negative type
arXiv:2501.07098
Abstract
The negative type inequalities of a metric space are closely tied to embeddability. A result by Gupta, Newman, and Rabinovich implies that if a metric graph does not contain a theta submetric as an embedding, then has negative type. We show the converse: if a metric graph contains a theta, then it does not have negative type.
5 pages, 2 figures