Generative Structural Theory v1.140 — Residual Obstructions to Cross-Port Two-Step Connections

This preprint studies two-step connections between leaf lifts of two minimally strongly connected directed graphs, K and K′, when each step may delete at most two edges. At either cross pair, the intermediate state can take either of two previously classified forms, one built from K and the other from K′. Theorem R gives an exact criterion for both forms to fail at a given cross pair t. This happens precisely when t belongs to neither graph, K has at least two witnesses at t, and at least one witness of K′ at t is an edge shared by both graphs. A witness is an edge that can be removed after t is added while preserving strong connectivity. Example P realizes this obstruction at both cross pairs on a base set of 20 vertices, even under the four-port grid condition (G). Lemma U shows that the endpoint conditions, the grid, and the obstruction at both cross pairs together imply the vertex condition (S) from v1.136. Example P therefore also satisfies (S). A second example, Example Q, realizes the obstruction on seven base vertices under the endpoint conditions alone. The question of whether another intermediate state or a longer sequence can connect the two leaf lifts remains open in this version. The verification appendix includes fixed-instance reachability checks for Example P and checks of agreement between the PDF and plain-text manuscript.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24283282
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.140 — Residual Obstructions to Cross-Port Two-Step Connections

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

Generative Structural Theory v1.140 — Residual Obstructions to Cross-Port Two-Step Connections

Koji Okino
preprint en

Abstract

This preprint studies two-step connections between leaf lifts of two minimally strongly connected directed graphs, K and K′, when each step may delete at most two edges. At either cross pair, the intermediate state can take either of two previously classified forms, one built from K and the other from K′. Theorem R gives an exact criterion for both forms to fail at a given cross pair t. This happens precisely when t belongs to neither graph, K has at least two witnesses at t, and at least one witness of K′ at t is an edge shared by both graphs. A witness is an edge that can be removed after t is added while preserving strong connectivity. Example P realizes this obstruction at both cross pairs on a base set of 20 vertices, even under the four-port grid condition (G). Lemma U shows that the endpoint conditions, the grid, and the obstruction at both cross pairs together imply the vertex condition (S) from v1.136. Example P therefore also satisfies (S). A second example, Example Q, realizes the obstruction on seven base vertices under the endpoint conditions alone. The question of whether another intermediate state or a longer sequence can connect the two leaf lifts remains open in this version. The verification appendix includes fixed-instance reachability checks for Example P and checks of agreement between the PDF and plain-text manuscript.

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