Order-13 parameter-three gamma–theta exclusion

Order-13 parameter-three release

This release contains the first public edition of:

Alec Kriebel, Excluding Parameter Three at Order Thirteen in the
gamma--theta Conjecture for One-Guard Eternal Domination (2026).

The certified finite theorem is:

No finite simple graph on 13 vertices satisfies
gamma(G) = gamma_infinity(G) = 3 < theta(G).

The proof splits at a maximum independent triple. The full-response branch
and the residual no-full branch are discharged by independently reconstructed
RUP certificates; the latter uses a separate four-neutral obstruction.
Exact hashes, coverage counts, sharp satisfiable controls, proof checkers, and
the compact aggregate replay are included in the tagged source.

This result does not exclude common parameters four or five at order 13,
does not prove the all-order parameter-three case, and does not resolve the
universal gamma--theta conjecture.

The work was produced with heavy assistance from ChatGPT 5.6 Sol under Alec
Kriebel's direction. It has not been externally peer reviewed. No outside
individual was contacted during the project.