Generative Structural Theory v1.153 — Why the (1,0) Class Has a Unique Non-Revisiting Connection with Eight Deletions in Example P
Version 1.152 identified 24 reduced connections from W′ to W in the (1,0) class of Example P with exactly eight edge deletions in total. Exactly one visits no state twice. This preprint identifies the outside pair used by that connection and proves why its sequence of states is unique. Every state is a minimally strongly connected digraph on the same 21 labelled vertices, and each step deletes at most two directed edges. In the (1,0) class, every intermediate state retains all edges common to W′ and W, and exactly one distinct directed edge outside W′ ∪ W occurs over the entire connection. The unique non-revisiting connection uses the outside pair (v, a′). Its five steps follow the state masks 15 → 135 → 148 → 163 → 176 → 112 and delete 1, 2, 2, 2 and 1 edges, respectively. For this fixed pair, the proof derives the four possible intermediate states and shows that only the displayed order gives eight deletions without a revisit. Of the 387 possible outside pairs, a structural argument rules out 299. After accounting for (v, a′), the exclusion of the remaining 87 candidates uses a finite check. The 24 connections in the class use 11 outside pairs. A comparison of the complete sequences of labelled states, including both endpoints, matches all 24 with the records of v1.152.
Authors
- Koji Okino (ORCID: https://orcid.org/0009-0003-9273-9813)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24368779
- Primary Topic
- Advanced Graph Theory Research
- Type
- preprint