The H-union-K_2 perfect-divisibility conjecture

Let HH be a graph, let K2K_2 be the complete graph on two vertices, and let kN>2k\in\mathbb{N}_{>2}. Assume that every HH-free graph is perfectly (k2)(k-2)-divisible. The H-union-K_2 conjecture. Then every (HK2)(H\cup K_2)-free graph is perfectly kk-divisible. This conjecture proposes a general mechanism for lifting perfect divisibility from HH-free graphs to graphs forbidding the disjoint union HK2H\cup K_2; the supplied source gives no resolution status.

Sources & referencesView supporting material

Primary source

David Scholz, “On the perfect k-divisibility of graphs”, arXiv:2503.10206 (2025).

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.