The proper hat-guessing number of K_5-e
Statement
Determine the exact proper hat-guessing number of the complete graph on five vertices with one edge removed. The existing bounds left in .
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.