nodo(X) :- #int(X), X > 0.
arco(X,Y) :- nodo(X), nodo(Y), X < Y.

blue(X,Y) v red(X,Y):- arco(X,Y).


% Eliminate those colorings that contain a blue complete graph
% with 6 nodes

:- blue(W,X), blue(W,Y), blue(X,Y), blue(W,Z), blue(Z,X), blue(Z,Y), blue(W,T), blue(X,T), blue(Y,T), blue(Z,T), blue(W,L), blue(X,L), blue(Y,L), blue(Z,L), blue(T,L).

% Eliminate those colorings that contain a red complete graph
% with 3 nodes

:- red(W,X), red(W,Y), red(X,Y).
