Babai's bounded chromatic number conjecture for semi-minimal Cayley graphs
Statement
Let be a group and let be a semi-minimal generating set: generates , and no is expressible in terms of . The graph is then a semi-minimal Cayley graph. Babai's conjecture. There is a constant such that every semi-minimal Cayley graph has chromatic number at most . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.