From my [previous question][1], if I consider a list like this:

$\{$$\{$$\{$$1,2,3$$\}$,$\{$$4,5,6$$\}$$\}$,
$\{$$\{$$1,2,4$$\}$,$\{$$3,5,6$$\}$$\}$,
$\{$$\{$$1,2,5$$\}$,$\{$$3,4,6$$\}$$\}$,
$\{$$\{$$1,2,6$$\}$,$\{$$3,4,5$$\}$$\}$,
$\{$$\{$$1,3,4$$\}$,$\{$$2,5,6$$\}$$\}$,
$\{$$\{$$1,3,5$$\}$,$\{$$2,4,6$$\}$$\}$,
$\{$$\{$$1,3,6$$\}$,$\{$$2,4,5$$\}$$\}$,
$\{$$\{$$1,4,5$$\}$,$\{$$2,3,6$$\}$$\}$,
$\{$$\{$$1,4,6$$\}$,$\{$$2,3,5$$\}$$\}$,
$\{$$\{$$1,5,6$$\}$,$\{$$2,3,4$$\}$$\}$$\}$

how can I delete all the permuted sublists containing in one of their subset $2$ different integers already present in one of the subsets of the previous permuted sublists? I hope the request is clear.
In the showed case, the output would just be:

$\{$$\{$$1,2,3$$\}$,$\{$$4,5,6$$\}$$\}$



While considering the sublists of $6$ elements divided in subsets of length $2$, starting with

$\{$$\{$$1,2$$\}$,$\{$$3,4$$\}$,$\{$$5,6$$\}$$\}$

this one has to be deleted:

$\{$$\{$$1,3$$\}$,$\{$$2,4$$\}$,$\{$$5,6$$\}$$\}$

while this one should be in the output:

$\{$$\{$$1,3$$\}$,$\{$$4,5$$\}$,$\{$$2,6$$\}$$\}$

 


  [1]: https://mathematica.stackexchange.com/questions/279672/permutations-with-subsets-not-containing-the-same-elements