proposition: Lemma stable_compl A : stable (A : {set compl G}) = cliqueb A.
proof: Proof. apply/stableP/cliqueP => [stabA|clA] x y xA yA; first move=> xDy. by move: (stabA _ _ xA yA); rewrite {1}/edge_rel/= xDy negbK. have [<-|xDy] := eqVneq x y; by [rewrite sgP|rewrite /edge_rel/= xDy clA]. Qed.
imports: mathcomp(all_ssreflect) GraphTheory(preliminaries bij digraph) GraphTheory(sgraph dom partition)