AFTD Auto-Formalizing Theoretical Domains

digraph_robust_pair_source16_graph

def

The seven-regular cyclic tournament on fifteen vertices with one additional source pointing to all fifteen tournament vertices.

Statement

def digraph_robust_pair_source16_graph : Digraph (Fin 16)
Source
Finite pair-deletion obstruction for the four-cycle campaign; experiments 13432 and 13435.
Verified
02 Nov 2026
Axioms
none listed
Used by 1

Lean source view module on GitHub

def digraph_robust_pair_source16_graph : Digraph (Fin 16) where
  Adj u v := v ≠ 15 ∧ (u = 15 ∨ (u ≠ 15 ∧ 1 ≤ (v.val + 15 - u.val) % 15 ∧ (v.val + 15 - u.val) % 15 ≤ 7))
See it in the graphDiscuss this resultChallenge it