
theorem
for n being Nat
 ex R being finite RelStr st clique# R = 2 & chromatic# R > n
proof
 let n be Nat;
 take Mycielskian n;
  n+1+1 > n+1 & n+1 > n by NAT_1:13;
  then n+2 > n by XXREAL_0:2;
 hence thesis by Th50;
end;
