Some Questions — Question 37
Statement
Let be a bounded-degree expander, or strongly ergodic, graphing that can be properly colored by colors with arbitrarily small error. Can it be properly -colored?
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.