
theorem
for n being Nat
 ex G being finite SimpleGraph st clique# G = 2 & chromatic# G > n
proof
 let n be Nat;
 set P2 = CompleteSGraph 2;
 reconsider G = (MycielskianSeq P2).n as finite SimpleGraph;
 take G;
  n+1+1 > n+1 & n+1 > n by NAT_1:13;
  then n+2 > n by XXREAL_0:2;
 hence thesis by Th118;
end;
