Packing–saturation equivalence conjecture for triangles
Packing–saturation equivalence conjecture for triangles
Let be the -colour -clique packing number, and let be the corresponding -colour saturation parameter. Here means that and are within constant factors.
Packing–saturation conjecture.
The conjecture concerns whether the two parameters have the same asymptotic order. The source presents it as a more modest open question after discussing possible separation between semisaturation and saturation.
Sources & referencesView supporting material
Primary source
Yamaan Attwa, Sam Mattheus, Tibor Szabó and Jacques Verstraete, “Improved bounds for the minimum degree of minimal multicolor Ramsey graphs”, arXiv:2510.09068 (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.