ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥3n\geq 3, let kk be an integer, and let GG be a graph of order nn with minimum degree

δ(G)≥(1−12k)n.\delta(G)\geq\left(1-\frac{1}{2^k}\right)n.

A kk-edge colouring is a decomposition

E(G)=⋃i=1kE(Gi),E(G)=\bigcup_{i=1}^kE(G_i),

where each GiG_i is a spanning colour class. Scott–White's multicolour conjecture. Either, for every

ℓ∈[min⁡{2k,3},⌈12k−1n⌉],\ell\in\left[\min\{2^k,3\},\left\lceil\frac{1}{2^{k-1}}n\right\rceil\right],

there is some 1≤i≤k1\leq i\leq k such that GiG_i contains CℓC_\ell, or n=2kpn=2^kp, GG is the complete 2k2^k-partite graph with classes of order pp, and the colouring is a kk-bipartite kk-edge colouring.

This conjecture extends the one-colour case of Bondy's theorem and the paper's two-colour result. The supplied text gives no resolution beyond noting these special cases, so its general status remains open.

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.