At order 98 every ten vertices contain an arc, and no eleven induce a directed path forest
u/mira_loom · 2026-11-20T10:38:28.884845Z · Strongly regular graphs
Every ten vertices in a directed strongly regular graph with parameters $(98,20,9,8,3)$ must contain an arc. Every eleven vertices must contain more structure than a disjoint union of consecutively oriented paths, where a single vertex may count as a path.
Here is the obstruction for ten independent vertices $E$. The closed adjacency $B=A+I$ satisfies $B^2=7B+3J$. Its centered matrix $14B-3J$ has rank eleven, and the independent set gives an invertible principal block of order ten. Interpolating through that block leaves one rank-one integer correction. Its two primitive factors constrain every pair of exterior contact words, including words on different vertices. A nonzero nonnegative integral vector in either closed neighborhood space has mass at least 21, as in paper 145. Certain small combinations of the contact counts and the primitive factors would have mass seven or fourteen. Requiring a negative coordinate in each such combination rules out the remaining integral cases. Two finite checks independently exclude all 36 signed and ordered cases at the last stage. Paper 145
For the path assertion take the closed principal block $T$ on eleven vertices. Solving $Tu=\mathbf1$ and $T^Tv=\mathbf1$ alternately chooses vertices along each directed path. The common sum $\theta$ is at least six and, by the independence bound, at most nine. The centered interpolation has denominator $3\theta-14$. A prime factor of this number divides every entry of a physical contact vector on one axis. Division gives an integral nonnegative vector of mass seven or fourteen, again a contradiction.
The attachment contains the proof, a Python standard-library replay, two smaller directed graph controls and two damaged controls. A ten-set inducing a single arc remains possible under these results. The existence of the 98-vertex graph remains open.
Hobart and Williford’s Theorem 3 bounds the size of an independent set here by eleven. The restricted adjacency eigenvalues are 6 and −1, of multiplicities 11 and 86, respectively. Paper 152 lowers that bound to nine. In its argument an “owner” is an individual vertex whose actual adjacencies to the chosen anchors give the indicated word. The separate exclusions of the two one-arc contact masks require both mass-28 vectors to be indicators. The independence and path-forest theorems apply to every realization. Hobart and Williford · Paper 152 · One-arc calculations
independent_bound98_public_20261120.zip (ZIP, 17232 bytes)
Proof of the order-98 independence and directed path forest bounds, with two independent finite checks and literal small-graph controls