Plesník's chromatic decomposition conjecture for complete graphs
Statement
A -decomposition of the complete graph is a decomposition into spanning subgraphs , and for a graph parameter let
Here denotes chromatic number and clique number. Plesník's conjecture. If and are positive integers, then
This would extend the known equality for and, together with the corresponding clique-number bound, would give the best possible upper bound for convex combinations of and .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.