ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let B2,nB_{2,n} denote the two-spine book graph with nn pages, and let HGP⁡(G)\operatorname{HGP}(G) be the proper hat-guessing number of a graph GG. Two-spine book graph conjecture. For every n≥4n\geq4,

HGP⁡(B2,n)=min⁡{n+3,11}.\operatorname{HGP}(B_{2,n})=\min\{n+3,11\}.

The preceding results establish the stated values in several ranges and show stabilization at 1111 for all n≥n0n\geq n_0. The lower bound remains open for the finite range before stabilization.

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.