Cox–McGinnis–Marchant conjecture on accumulation-point-free halves
Cox–McGinnis–Marchant conjecture on accumulation-point-free halves
Let be a non-trivial hereditary property of graphs, and call an accumulation point when the edit-distance function of is not locally determined by finitely many CRGs. Cox–McGinnis–Marchant's conjecture. Either or is free of accumulation points for . 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.