Determine whether (4,C)-SymRelCol has a sudden hardness jump, and determine the order of g(6,n), the least g such that every n-vertex graph of maximum degree 6 has a…
Statement
Determine whether (4,C)-SymRelCol has a sudden hardness jump, and determine the order of g(6,n), the least g such that every n-vertex graph of maximum degree 6 has a two-coloring with every monochromatic component of order at most g.
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.