Cox–McGinnis–Marchant conjecture on accumulation-point-free halves

Let H{\mathcal H} be a non-trivial hereditary property of graphs, and call p[0,1]p\in[0,1] an accumulation point when the edit-distance function of H{\mathcal H} is not locally determined by finitely many CRGs. Cox–McGinnis–Marchant's conjecture. Either (0,1/2](0,1/2] or [1/2,1)[1/2,1) is free of accumulation points for H{\mathcal H}. Known examples show that interior accumulation points can occur, whereas the supplied source does not resolve whether one of these two half-intervals must always be free of accumulation points.

Sources & referencesView supporting material

Primary source

Sergey Kitaev and Ryan R. Martin, “The edit distance of word-representable and comparability graphs”, arXiv:2605.18308 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.