Cherlin's metric homogeneity classification conjecture
Statement
A metrically homogeneous graph is a countable graph whose graph distance is preserved by every isomorphism between finite subgraphs; write 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 denote Macpherson’s regular tree-like graph with parameters , and let and be the classes described in the catalogue, with 3-constrained and of Henson type or antipodal Henson type.
Cherlin's metric homogeneity classification conjecture. The countable metrically homogeneous graphs are the following: those of diameter , namely the homogeneous graphs classified by Lachlan and Woodrow; in diameter , the finite graphs classified by Cameron, Macpherson’s regular tree-like graphs with , and the Fraïssé limits of amalgamation classes of the form with 3-constrained and 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.