ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Kn,nK_{n,n} be the complete bipartite graph with nn vertices in each part, and let HG(G)\mathrm{HG}(G) denote the hat-guessing number of a graph GG. For n≥3n\geq 3, the conjectured bound is

Complete bipartite hat-guessing conjecture.

HG(Kn,n)≤n.\mathrm{HG}\left(K_{n,n}\right)\leq n.

This generalizes the proved value HG(K3,3)=3\mathrm{HG}\left(K_{3,3}\right)=3 and would determine the upper bound suggested by the known inequality HG(Kn,n)≤n+1\mathrm{HG}\left(K_{n,n}\right)\leq n+1. The question remains open for n>3n>3.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.