Work

Generative Structural Theory v1.145 — Shortest Reverse Connections Beyond the Two-Cycle Family in Example P

Year: 2026
Type: preprint
Abstract: Are there shortest reverse connections from W′ to W in Example P beyond the 20 constructed in v1.144? This preprint gives nine more. The endpoints W′ and W are minimally strongly connected directed graphs on the same 21 vertices. Every intermediate graph must also be minimally strongly connected, and each step may delete at most two directed edges. The vertex v belongs to both W′ and W. Their respective base graphs K′ and K share nine directed paths of the form x → c → y used in this construction. For each path, adding the parallel path x → v → y to K′ and to K gives the two intermediate states of a three-step connection from W′ to W. One of the nine connections deletes five edges in total and uses one distinct edge outside W ∪ W′. Each of the other eight deletes six edges and uses two distinct edges outside that union. Together with v1.144, this gives at least 29 distinct shortest reverse connections, at least five of which attain the minimum of five deletions. The lower bounds of three steps and five deletions come from Corollary G3 of v1.144 and depend on fixed-instance checks reported in v1.141 and v1.142. A complete classification remains open.
Author: Okino, Koji
Language: English
Open Access status: green
OpenAlex ID: W7236800048
Cites:
Cited by:
Related to: 10