ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let Δ\Delta be its maximum degree, and let HG(G)\mathrm{HG}(G) denote its hat-guessing number.

Maximum-degree hat-guessing conjecture.

HG(G)≤Δ+1.\mathrm{HG}(G)\leq \Delta+1.

This conjecture tightens the folklore upper bound eΔe\Delta 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 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.