ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GammaGamma be a group and let S=s1,ldots,snS={s_1,ldots,s_n} be a semi-minimal generating set: SS generates GammaGamma, and no sis_i is expressible in terms of s1,ldots,si−1s_1,ldots,s_{i-1}. The graph Cay⁡(Gamma,S)\operatorname{Cay}(Gamma,S) is then a semi-minimal Cayley graph. Babai's conjecture. There is a constant cc such that every semi-minimal Cayley graph has chromatic number at most cc. The source presents this as an open problem and remarks that Babai made the same conjecture for semi-minimal Cayley graphs; the paper asks whether its construction can be modified to disprove the original minimal-Cayley-graph conjecture.

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.