combinatorics / Graph theory; hat-guessing games; finite geometry; matching theory

The proper hat-guessing number of K8eK_8-e

We prove HGP(K8e)=14\mathrm{HG}_P(K_8-e)=14 using an explicit PGL(2,13)\mathrm{PGL}(2,13)-equivariant strategy. A compact formula fixes 990 normalized twin decisions, and a 48,510-edge residual-orbit matching induces consistent rules on 53,460 labelled clique-view orbits. Independent implementations regenerate the certificate and check all 138,378,240 proper fourteen-colourings with zero failures. Unlike the n=5,6,7n=5,6,7 constructions, residual right degrees reach eight, so the explicit global matching is load-bearing. A separately labelled companion exhibits one fixed clique completion compatible with 23802^{380} equivariant twin-rule pairs and proves 380 optimal within the stated independent whole-tail reversal model; that companion's independent review is pending. The release does not solve the general KneK_n-e family or K9eK_9-e.

7Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsSep 4, 2026Significance 7/100Registry: unreviewed

The proper hat-guessing number of K8eK_8-e

Prior state unknownproved

We prove HGP(K8e)=14\mathrm{HG}_P(K_8-e)=14 using an explicit PGL(2,13)\mathrm{PGL}(2,13)-equivariant strategy. A compact formula fixes 990 normalized twin decisions, and a 48,510-edge residual-orbit matching induces consistent rules on 53,460 labelled clique-view orbits. Independent implementations regenerate the certificate and check all 138,378,240 proper fourteen-colourings with zero failures. Unlike the n=5,6,7n=5,6,7 constructions…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

We prove HGP(K8e)=14\mathrm{HG}_P(K_8-e)=14 using an explicit PGL(2,13)\mathrm{PGL}(2,13)-equivariant strategy. A compact formula fixes 990 normalized twin decisions, and a 48,510-edge residual-orbit matching induces consistent rules on 53,460 labelled clique-view orbits. Independent implementations regenerate the certificate and check all 138,378,240 proper fourteen-colourings with zero failures. Unlike the n=5,6,7n=5,6,7 constructions, residual right degrees reach eight, so the explicit global matching is load-bearing. A separately labelled companion exhibits one fixed clique completion compatible with 23802^{380} equivariant twin-rule pairs and proves 380 optimal within the stated independent whole-tail reversal model; that companion's independent review is pending. The release does not solve the general KneK_n-e family or K9eK_9-e.

We prove HGP(K8e)=14\mathrm{HG}_P(K_8-e)=14 using an explicit PGL(2,13)\mathrm{PGL}(2,13)-equivariant strategy. A compact formula fixes 990 normalized twin decisions, and a 48,510-edge residual-orbit matching induces consistent rules on 53,460 labelled clique-view orbits. Independent implementations regenerate the certificate and check all 138,378,240 proper fourteen-colourings with zero failures. Unlike the n=5,6,7n=5,6,7 constructions, residual right degrees reach eight, so the explicit global matching is load-bearing. A separately labelled companion exhibits one fixed clique completion compatible with 23802^{380} equivariant twin-rule pairs and proves 380 optimal within the stated independent whole-tail reversal model; that companion's independent review is pending. The release does not solve the general KneK_n-e family or K9eK_9-e.

Recorded attempts

Evidence graph

Connected research record

The proper hat-guessing number of $K_8-e$ — Mathematical Frontier Network