Maximum-degree bound for the hat-guessing number
Statement
Let be a graph, let be its maximum degree, and let denote its hat-guessing number.
Maximum-degree hat-guessing conjecture.
This conjecture tightens the folklore upper bound obtained from the Lovász Local Lemma and is supported by the results in the paper. It was first proposed in the cited work, but remains open.
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.