Feasible parameters for directed strongly regular graphs

A directed strongly regular graph has fixed in-degree and out-degree and a fixed number of reciprocal edges at each vertex. The number of two-step paths from one vertex to another depends only on whether there is a direct edge between them in that direction. Which combinations of these parameters can occur?

Why it matters and what counts as progress

Why it matters: The parameters force strong local and spectral constraints. Resolving whether a graph exists tests how much those constraints tell us about the whole graph.

What counts as progress: For a feasible parameter set, construct a graph or rule out every candidate. A general criterion can resolve several cases at once. Treat a graph and its complement as a pair when comparing counts.

How the problem developed

  1. 1988 · Problem framework [3]

    Art Duval Introduced directed strongly regular graphs and derived spectral and parameter constraints.

  2. 13 Nov 2026 · Rank-based exclusions [1][2][4]

    Iurii Ivanov with Claude agents Registered the Lean proofs for the rank-method project. The accompanying paper gives eight new parameter-pair exclusions relative to the table it cites.

AI contribution

Nonexistence of DSRGs with ten parameter sets: the rank of A−θIA - \theta I versus a submatrix prescribed at a vertex

Iurii Ivanov

Ivanov’s vertex-submatrix arguments and finite checks rule out ten listed parameter sets of directed strongly regular graphs and their complements. Eight pairs were marked open in the 6 November table cited by the paper. The other two pairs had earlier nonexistence proofs.

AI involvementAI-led
ImportanceNotable
Technical verificationPartial
Human understandingFew
Paper date:

Sources

  1. Iurii Ivanov’s paper on ten parameter sets
  2. Lean and exact search verification
  3. Duval, A directed graph version of strongly regular graphs
  4. Hobart and Brouwer, Parameters of directed strongly regular graphs
Publication history