
theorem
for n being Nat
 ex G being finite SimpleGraph st stability# G = 2 & cliquecover# G > n
proof
 let n be Nat;
 set G = (MycielskianSeq CompleteSGraph 2).n;
  n+1+1 > n+1 & n+1 > n by NAT_1:13;
  then n+2 > n by XXREAL_0:2;
 then A1: clique# G = 2 & chromatic# G > n by Th118;
 take S = Complement G;
 thus stability# S = 2 by A1,Th76;
 thus cliquecover# S > n by A1,Th82;
end;
