The proper hat-guessing number conjecture for two-spine book graphs

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 n4n\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 nn0n\geq n_0. The lower bound remains open for the finite range before stabilization.

Sources & referencesView supporting material

Primary source

Yulin Zhai, “Proper Hat-Guessing on Two-Spine Book Graphs”, arXiv:2607.25274 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.