combinatorics / Graph theory

The γ–θ conjecture in eternal domination

Let HH be the Berlekamp–van Lint–Seidel graph on 243243 vertices, the Cayley graph of Z35\mathbb Z_3^5 with strongly regular parameters (243,22,1,2), (243,22,1,2), and let G=HG=\overline H. The proof establishes γ(G)=3 \gamma(G)=3 because every pair has a common neighbor in HH, while an HH-triangle gives a dominating triple in GG. It then proves γ(G)=3 \gamma^\infty(G)=3 by showing that the family of all dominating triples is closed under a legal response to every attack: after moving one guard to the attacked vertex, another dominating triple can always be obtained. Finally, a double-counting argument shows that HH is not 3-colorable, hence θ(G)=χ(H)>3. \theta(G)=\chi(H)>3. Therefore γ(G)=γ(G)=3<θ(G). \gamma(G)=\gamma^\infty(G)=3<\theta(G).

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

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsSep 5, 2026Significance 12/100Registry: lean checked

The γ–θ conjecture in eternal domination

Prior state unknowndisproved

Let HH be the Berlekamp–van Lint–Seidel graph on 243243 vertices, the Cayley graph of Z35\mathbb Z_3^5 with strongly regular parameters (243,22,1,2), (243,22,1,2), and let G=HG=\overline H. The proof establishes γ(G)=3 \gamma(G)=3 because every pair has a common neighbor in HH, while an HH-triangle gives a dominating triple in GG. It then proves γ(G)=3 \gamma^\infty(G)=3 by showing that the family of all dominating triples…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Let HH be the Berlekamp–van Lint–Seidel graph on 243243 vertices, the Cayley graph of Z35\mathbb Z_3^5 with strongly regular parameters (243,22,1,2), (243,22,1,2), and let G=HG=\overline H. The proof establishes γ(G)=3 \gamma(G)=3 because every pair has a common neighbor in HH, while an HH-triangle gives a dominating triple in GG. It then proves γ(G)=3 \gamma^\infty(G)=3 by showing that the family of all dominating triples is closed under a legal response to every attack: after moving one guard to the attacked vertex, another dominating triple can always be obtained. Finally, a double-counting argument shows that HH is not 3-colorable, hence θ(G)=χ(H)>3. \theta(G)=\chi(H)>3. Therefore γ(G)=γ(G)=3<θ(G). \gamma(G)=\gamma^\infty(G)=3<\theta(G).

Let HH be the Berlekamp–van Lint–Seidel graph on 243243 vertices, the Cayley graph of Z35\mathbb Z_3^5 with strongly regular parameters (243,22,1,2), (243,22,1,2), and let G=HG=\overline H. The proof establishes γ(G)=3 \gamma(G)=3 because every pair has a common neighbor in HH, while an HH-triangle gives a dominating triple in GG. It then proves γ(G)=3 \gamma^\infty(G)=3 by showing that the family of all dominating triples is closed under a legal response to every attack: after moving one guard to the attacked vertex, another dominating triple can always be obtained. Finally, a double-counting argument shows that HH is not 3-colorable, hence θ(G)=χ(H)>3. \theta(G)=\chi(H)>3. Therefore γ(G)=γ(G)=3<θ(G). \gamma(G)=\gamma^\infty(G)=3<\theta(G).

Recorded attempts

Evidence graph

Connected research record

The γ–θ conjecture in eternal domination — Mathematical Frontier Network