Metric graphs of negative type
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929685317812224 |
|---|---|
| author | Campbell, Rutger Hendrey, Kevin Lund, Ben Tompkins, Casey |
| author_facet | Campbell, Rutger Hendrey, Kevin Lund, Ben Tompkins, Casey |
| contents | 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 $G$ does not contain a theta submetric as an embedding, then $G$ has negative type. We show the converse: if a metric graph $G$ contains a theta, then it does not have negative type. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_07098 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Metric graphs of negative type Campbell, Rutger Hendrey, Kevin Lund, Ben Tompkins, Casey Combinatorics 05C12, 51F99 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 $G$ does not contain a theta submetric as an embedding, then $G$ has negative type. We show the converse: if a metric graph $G$ contains a theta, then it does not have negative type. |
| title | Metric graphs of negative type |
| topic | Combinatorics 05C12, 51F99 |
| url | https://arxiv.org/abs/2501.07098 |