Polynomial stubborn 2-list cover conjecture
Statement
Can the set of solutions of every instance of the stubborn problem be covered by instances consisting of lists of size ?
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.