C1: degree sequences and minimum degree
   ok for all odd n in [7,61]: |E(H)|=(3n+3)/2, degrees 3^(n-3) 4^3, delta(G_n)=(n+1)/2
   H_7 (R1) edges: [(0, 2), (0, 5), (0, 6), (1, 2), (1, 3), (1, 6), (2, 4), (3, 4), (3, 5), (4, 5), (4, 6), (5, 6)]
   G_7 edges     : [(0, 1), (0, 4), (0, 5), (0, 6), (1, 4), (1, 5), (1, 6), (2, 3), (2, 4), (2, 5), (2, 6), (3, 4), (3, 5), (3, 6)]
C2: brute force over all bijections
   n=7 R1: embedding exists? False
   n=7 R2: embedding exists? False
   n=9 R1: embedding exists? False
   n=9 R2: embedding exists? False
C3: all independent (n-1)/2-sets J of H, test H-J <= G_n[A]
   n= 7  R1: 2 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n= 9  R1: 1 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=11  R1: 2 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=13  R1: 1 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=15  R1: 2 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=17  R1: 1 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=19  R1: 2 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=21  R1: 1 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=23  R1: 2 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=25  R1: 1 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=27  R1: 2 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=29  R1: 1 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=31  R1: 2 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=33  R1: 1 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=35  R1: 2 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=37  R1: 1 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=39  R1: 2 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=41  R1: 1 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=43  R1: 2 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=45  R1: 1 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=47  R1: 2 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=49  R1: 1 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=51  R1: 2 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=53  R1: 1 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=55  R1: 2 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=57  R1: 1 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=59  R1: 2 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
   n=61  R1: 1 independent sets of size (n-1)/2, 0 usable;  R2: 0 independent sets of size (n-1)/2, 0 usable
C4: independent SAT test (no reduction)
   n=7: UNSAT for R1 and R2
   n=9: UNSAT for R1 and R2
   n=11: UNSAT for R1 and R2
   n=13: UNSAT for R1 and R2
   n=15: UNSAT for R1 and R2
   n=17: UNSAT for R1 and R2
   n=19: UNSAT for R1 and R2
   n=21: UNSAT for R1 and R2
   n=23: UNSAT for R1 and R2
   n=25: UNSAT for R1 and R2
ALL CHECKS PASSED
