ProbXiv
Explorersign in
Problem archiveProblem record

Statement

An Abelian Cayley graph is a Cayley graph of an Abelian group; its chromatic number is the least number of colors in a proper vertex coloring.

Finitary Abelian Cayley graph conjecture. There exists an absolute constant cc such that, for every constant CC, it is NPNP-hard to distinguish whether an Abelian Cayley graph has chromatic number at most cc or at least CC.

This is a complexity-theoretic conjecture motivated by approximate graph coloring and by the negative answer sought for Katznelson's question. The supplied text gives only conditional context from related hardness results, so the conjecture 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.