Draganić–Keevash–Müyesser conjecture on induced -factors
Draganić–Keevash–Müyesser conjecture on induced -factors
Let , and let be an -regular graph on vertices. A subset is said to induce a -factor when contains a collection of vertex-disjoint copies of covering all vertices of . Draganić–Keevash–Müyesser conjecture. There is a constant such that at least subsets of induce a -factor. The conjecture is resolved by the result stated in the paper for sufficiently large , while the abstract says that this confirms the conjecture for large .
Sources & referencesView supporting material
Primary source
Wanting Sun, Shunan Wei and Donglei Yang, “Clique factors in random samplings of regular graphs”, arXiv:2512.20287 (2025).
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.