Work

Generative Structural Theory v1.149 — The First State Revisits in Example P: Revisiting Connections with Seven Deletions

Year: 2026
Type: preprint
Abstract: What is the smallest total number of edge deletions that allows a connection from W′ to W to visit the same graph twice? In Example P, the answer is seven. Every graph in the sequence is minimally strongly connected on the same 21 labelled vertices. Consecutive graphs are distinct, and each step may delete at most two directed edges. Added edges may lie outside the union of W′ and W. The threshold follows from the cost of a return. A segment that leaves a graph X and returns to X costs at least two deletions. Removing that segment leaves a connection from W′ to W, which requires at least five. At a total of seven, the return must therefore have the form X → Y → X, with each step deleting one edge and adding one. Conversely, inserting such a return into any of the 21 minimum-deletion connections produces a seven-deletion connection that revisits a graph. An explicit example attains the bound. With the vertex labels fixed, the computation gives exactly 13,249 distinct revisiting connections: 8,074 with five steps and 5,175 with six. There are 13,284 ways to insert a return because 35 connections can each be obtained in two ways. Of the distinct connections, 2,646 revisit W′ and 3,192 reach W before the final step. None does both. A search that stops on its first arrival at W therefore misses 3,192 connections. The classification covers all reduced connections from W′ to W with exactly seven deletions that revisit a graph. The computational appendix provides the programs, inputs, and complete lists of connections.
Author: Okino, Koji
Language: English
Open Access status: green
OpenAlex ID: W7236618103
Cites:
Cited by:
Related to: 10