ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A kk-decomposition of the complete graph KnK_n is a decomposition into kk spanning subgraphs G1,…,GkG_1,\ldots,G_k, and for a graph parameter pp let

p(k;Kn)=max⁡{∑j=1kp(Gj)∣(G1,…,Gk) is a k-decomposition of Kn}.p(k;K_n)=\max\left\{\sum_{j=1}^{k}p(G_j)\mid (G_1,\ldots,G_k)\text{ is a $k$-decomposition of }K_n\right\}.

Here χ\chi denotes chromatic number and ω\omega clique number. Plesník's conjecture. If kk and nn are positive integers, then

χ(k;Kn)≤n+(k2).\chi(k;K_n)\leq n+{k\choose 2}.

This would extend the known equality χ(k;Kn)=ω(k;Kn)\chi(k;K_n)=\omega(k;K_n) for k≤3k\leq 3 and, together with the corresponding clique-number bound, would give the best possible upper bound for convex combinations of ω\omega and χ\chi.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.