Hat-guessing number bound for complete bipartite graphs
Statement
Let be the complete bipartite graph with vertices in each part, and let denote the hat-guessing number of a graph . For , the conjectured bound is
Complete bipartite hat-guessing conjecture.
This generalizes the proved value and would determine the upper bound suggested by the known inequality . The question remains open for .
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.