The degree-sequence conjecture for perfect graph packings
Let and let be a graph with chromatic number . A perfect -packing is a collection of vertex-disjoint copies of covering all vertices. Let be a graph of order with degree sequence .
Perfect-packing conjecture. There is an integer such that, whenever , divides , and
contains a perfect -packing.
This is proposed as a likely consequence or application of the preceding perfect -packing conjecture. No proof or resolution is given in the source, so the asymptotic generalization remains open.
References
- József Balogh, Alexandr V. Kostochka and Andrew Treglown, “On perfect packings in dense graphs”, arXiv:1110.3490 (2013).
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.