Generative Structural Theory v1.154 -- A Structural Proof of the Unique Non-Revisiting Connection in the (1,0) Class of Example P

In Example P, the minimally strongly connected directed graphs W' and W share 26 ordered pairs on 21 labelled vertices. Consider reduced connections from W' to W in which every state is minimally strongly connected and retains all 26 common pairs, each step deletes at most two pairs, and exactly one ordered pair outside W' union W occurs along the connection. Among these connections with eight deletions in total, exactly one visits no state twice. This preprint gives a structural proof of the exclusion of all other outside pairs. A cut criterion leaves 88 candidates. For a pair leaving v, transferring the mask sequence to the case (v,a') forces the state represented by mask 148. Unless the original pair ends at a', an explicit bypass makes a common pair redundant. For pairs entering v or having neither end at v, port constraints, cuts and deletion counts exclude a non-revisiting connection. The argument uses upper bounds on admissible masks and the reasoning results of v1.153. The unique connection uses the outside pair (v,a') and has mask sequence 15 -> 135 -> 148 -> 163 -> 176 -> 112, with deletion counts 1, 2, 2, 2 and 1. The exact mask lists for 33 outside pairs and the earlier classification of 24 connections, one non-revisiting and 23 revisiting, retain their finite-check basis. The general two-deletion question (Q1) remains open. The accompanying files include the paper in PDF and plain text, a computational appendix with checks of the stated proof facts and their inputs, and a document-check appendix with the PDF source and reproduction programs. The machine checks and comparisons are documented as checks of stated facts, separate from the mathematical proof.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24371614
Primary Topic
Advanced Graph Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Generative Structural Theory v1.154 -- A Structural Proof of the Unique Non-Revisiting Connection in the (1,0) Class of Example P

Koji Okino
Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
preprint

Generative Structural Theory v1.154 -- A Structural Proof of the Unique Non-Revisiting Connection in the (1,0) Class of Example P

Koji Okino
preprint en

Abstract

In Example P, the minimally strongly connected directed graphs W' and W share 26 ordered pairs on 21 labelled vertices. Consider reduced connections from W' to W in which every state is minimally strongly connected and retains all 26 common pairs, each step deletes at most two pairs, and exactly one ordered pair outside W' union W occurs along the connection. Among these connections with eight deletions in total, exactly one visits no state twice. This preprint gives a structural proof of the exclusion of all other outside pairs. A cut criterion leaves 88 candidates. For a pair leaving v, transferring the mask sequence to the case (v,a') forces the state represented by mask 148. Unless the original pair ends at a', an explicit bypass makes a common pair redundant. For pairs entering v or having neither end at v, port constraints, cuts and deletion counts exclude a non-revisiting connection. The argument uses upper bounds on admissible masks and the reasoning results of v1.153. The unique connection uses the outside pair (v,a') and has mask sequence 15 -> 135 -> 148 -> 163 -> 176 -> 112, with deletion counts 1, 2, 2, 2 and 1. The exact mask lists for 33 outside pairs and the earlier classification of 24 connections, one non-revisiting and 23 revisiting, retain their finite-check basis. The general two-deletion question (Q1) remains open. The accompanying files include the paper in PDF and plain text, a computational appendix with checks of the stated proof facts and their inputs, and a document-check appendix with the PDF source and reproduction programs. The machine checks and comparisons are documented as checks of stated facts, separate from the mathematical proof.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Generative Structural Theory v1.154 -- A Structural Proof of the Unique Non-Revisiting Connection in the (1,0) Class of Example P — Koji Okino · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS