Generative Structural Theory v1.155 -- Admissible Outside Pairs and Revisiting Connections in the (1,0) Class of Example P

Which ordered pairs outside the union of two directed graphs can occur in a connection between them? In Example P, W′ and W are minimally strongly connected digraphs on the same 21 labelled vertices. We consider connections from W′ to W that keep all 26 common pairs, use exactly one outside pair, and delete eight pairs in total, at most two per step. Every intermediate graph must also be minimally strongly connected. Of the 387 outside pairs, 33 admit at least one intermediate state, and only 11 support a complete connection. For example, (v,x) admits a state but supports no connection, whereas (v,a′) supports seven. The proof determines admissible states by testing reachability on a fixed core of 17 vertices. It then lists every possible walk in six families of masks. The 13 resulting mask sequences give 24 connections once the outside pair is specified. Exactly one connection visits no state twice. Of the 23 that revisit a state, 14 take five steps and nine take six. In each one, removing a two-step return gives the same shorter connection whichever return is removed. The distinct results are exactly the 21 minimum-deletion connections classified in v1.146. The general two-deletion question (Q1) remains open. The accompanying files include the paper in PDF and plain text, the proof and table checks with their inputs, and the programs for reproducing the PDF.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-22
DOI
https://doi.org/10.5281/zenodo.24417021
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.155 -- Admissible Outside Pairs and Revisiting Connections 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.155 -- Admissible Outside Pairs and Revisiting Connections in the (1,0) Class of Example P

Koji Okino
preprint en

Abstract

Which ordered pairs outside the union of two directed graphs can occur in a connection between them? In Example P, W′ and W are minimally strongly connected digraphs on the same 21 labelled vertices. We consider connections from W′ to W that keep all 26 common pairs, use exactly one outside pair, and delete eight pairs in total, at most two per step. Every intermediate graph must also be minimally strongly connected. Of the 387 outside pairs, 33 admit at least one intermediate state, and only 11 support a complete connection. For example, (v,x) admits a state but supports no connection, whereas (v,a′) supports seven. The proof determines admissible states by testing reachability on a fixed core of 17 vertices. It then lists every possible walk in six families of masks. The 13 resulting mask sequences give 24 connections once the outside pair is specified. Exactly one connection visits no state twice. Of the 23 that revisit a state, 14 take five steps and nine take six. In each one, removing a two-step return gives the same shorter connection whichever return is removed. The distinct results are exactly the 21 minimum-deletion connections classified in v1.146. The general two-deletion question (Q1) remains open. The accompanying files include the paper in PDF and plain text, the proof and table checks with their inputs, and the programs for reproducing the PDF.

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