Forbidden cycles in metrically homogeneous graphs

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In a recent paper by a superset of the authors it was proved that for every primitive 3-constrained space Γ of finite diameter δ from Cherlin’s catalogue of metrically homogeneous graphs, there exists a finite family F of {1,…,δ}-edge-labelled cycles such that a {1,…,δ}-edge-labelled graph is a subgraph of Γ if and only if it contains no homomorphic images of cycles from F. However, the cycles in the families F were not described explicitly as it was not necessary for the analysis of Ramsey expansions and the extension property for partial automorphisms. This paper fills this gap by providing an explicit description of the cycles in the families F, heavily using the previous result in the process. Additionally, we explore the potential applications of this result, such as interpreting the graphs as semigroup-valued metric spaces or homogenisations of ω-categorical {1,δ}-edge-labelled graphs.

Cite

CITATION STYLE

APA

Hubička, J., Kompatscher, M., & Konečný, M. (2026). Forbidden cycles in metrically homogeneous graphs. European Journal of Combinatorics, 132. https://doi.org/10.1016/j.ejc.2025.104262

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free