ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥4k\geq 4 be fixed, and let GG be a graph with maximal local edge-connectivity kk, meaning that the maximum local edge-connectivity over all pairs of vertices of GG is kk. A kk-colouring of GG is a proper vertex colouring using at most kk colours.

Polynomial-time k-colouring conjecture. There is a polynomial-time algorithm that, given GG, finds a kk-colouring of GG, or determines that none exists.

The conjecture concerns the unresolved complexity of kk-colouring for graphs with maximal local edge-connectivity kk when k≥4k\geq 4, following polynomial-time results for narrower connectivity classes and NP-completeness results for related colouring problems.

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.