Generative Structural Theory v1.150 — Completing the Classification of Reverse Connections with Seven Deletions in Example P

This preprint completes the classification of reduced connections from W′ to W with exactly seven edge deletions in Example P. Version 1.149 classified the 13,249 connections that revisit a state. This paper finds exactly 160,150 that visit no state twice, bringing the total to 173,399. Of these, 34,618 have four steps, 96,977 have five steps, and 41,804 have six steps. Each state is a minimally strongly connected directed graph on the same 21 labelled vertices. A connection is reduced when consecutive states differ. Each step may delete at most two edges and may add edges, including edges outside the union of W′ and W. Connections are counted by their sequences of intermediate states, with the vertex labels fixed. The paper proves that a reduced connection with seven deletions cannot revisit a state if it uses at least three distinct edges outside the union of the endpoints, or if at least two distinct edges common to both endpoints are each absent at some stage. A four-step example illustrates each condition. The counts come from two exhaustive searches on this fixed instance. A forward search in C++ and a backward search in Python each built its own catalogue of states and produced byte-identical lists of connections. The accompanying appendices provide the programs, input data, complete outputs, and instructions for reproducing the computation and the paper PDF.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24364906
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.150 — Completing the Classification of Reverse Connections with Seven Deletions in Example P

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

Generative Structural Theory v1.150 — Completing the Classification of Reverse Connections with Seven Deletions in Example P

Koji Okino
preprint en

Abstract

This preprint completes the classification of reduced connections from W′ to W with exactly seven edge deletions in Example P. Version 1.149 classified the 13,249 connections that revisit a state. This paper finds exactly 160,150 that visit no state twice, bringing the total to 173,399. Of these, 34,618 have four steps, 96,977 have five steps, and 41,804 have six steps. Each state is a minimally strongly connected directed graph on the same 21 labelled vertices. A connection is reduced when consecutive states differ. Each step may delete at most two edges and may add edges, including edges outside the union of W′ and W. Connections are counted by their sequences of intermediate states, with the vertex labels fixed. The paper proves that a reduced connection with seven deletions cannot revisit a state if it uses at least three distinct edges outside the union of the endpoints, or if at least two distinct edges common to both endpoints are each absent at some stage. A four-step example illustrates each condition. The counts come from two exhaustive searches on this fixed instance. A forward search in C++ and a backward search in Python each built its own catalogue of states and produced byte-identical lists of connections. The accompanying appendices provide the programs, input data, complete outputs, and instructions for reproducing the computation and the paper 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