ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A metrically homogeneous graph is a countable graph whose graph distance is preserved by every isomorphism between finite subgraphs; write δ\delta for its diameter. The Fraïssé limit of an amalgamation class is the countable ultrahomogeneous structure whose finite substructures are exactly the members of that class. Let Tm,nT_{m,n} denote Macpherson’s regular tree-like graph with parameters 2≤m,n≤∞2\leq m,n\leq\infty, and let A3\mathcal A_3 and AH\mathcal A_H be the classes described in the catalogue, with A3\mathcal A_3 3-constrained and AH\mathcal A_H of Henson type or antipodal Henson type.

Cherlin's metric homogeneity classification conjecture. The countable metrically homogeneous graphs are the following: those of diameter δ≤2\delta\leq 2, namely the homogeneous graphs classified by Lachlan and Woodrow; in diameter δ≥3\delta\geq 3, the finite graphs classified by Cameron, Macpherson’s regular tree-like graphs Tm,nT_{m,n} with 2≤m,n≤∞2\leq m,n\leq\infty, and the Fraïssé limits of amalgamation classes of the form A3∩AH\mathcal A_3\cap\mathcal A_H with A3\mathcal A_3 3-constrained and AH\mathcal A_H of Henson type or antipodal Henson type.

This is the catalogue attributed to Cherlin for countable metrically homogeneous graphs. The supplied text presents it as a classification and gives no evidence that the classification has been resolved, so its status is left open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.