G=K_2+K_1, b=2: r(G,K_3) = 3; 2-iatlon choice graphs on 3 vertices with a constrained copy of G: 0 of 3  =>  p(G,2) >= 4 > r(G,K_3) = 3: Problem 6.1 FAILS for this G
G=2K_2, b=2: r(G,K_3) = 5; 2-iatlon choice graphs on 5 vertices with a constrained copy of G: 0 of 59049  =>  p(G,2) >= 6 > r(G,K_3) = 5: Problem 6.1 FAILS for this G
