The H-union-K_2 perfect-divisibility conjecture
The H-union-K_2 perfect-divisibility conjecture
Let be a graph, let be the complete graph on two vertices, and let . Assume that every -free graph is perfectly -divisible. The H-union-K_2 conjecture. Then every -free graph is perfectly -divisible. This conjecture proposes a general mechanism for lifting perfect divisibility from -free graphs to graphs forbidding the disjoint union ; 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
Sign in to submit a solution.
No solutions have been posted yet.