title: Groups of pairwise combinations where each member appears only once
body: <p>I have a list of unique tuples each containing 2 elements from 1 to 10. A total number of elements in a list is 45. I would like to divide them into 10 groups each of them containing only numbers from 1 to 10.</p>
  
  <p>I have tried solve my problem using this answer: 
  <a href="https://stackoverflow.com/questions/54200347/python-get-groups-of-combinations-that-each-member-appear-only-once">python get groups of combinations that each member appear only once</a></p>
  
  <p>python:</p>
  
  <pre><code>from itertools import combinations, chain
  l = ['A','B','C','D','E', 'F', 'G','H','I','J']
  c = list(combinations(l,2))
  [set(i) for i in list(combinations(c,5)) if (len(set(l) &amp; set(chain(*i))) == len(l))]
  </code></pre>
  
  <p>But I get repetitions, like so:</p>
  
  <pre><code>[{('A', 'B'), ('C', 'D'), ('E', 'F'), ('G', 'H'), ('I', 'J')},
   {('A', 'B'), ('C', 'D'), ('E', 'F'), ('G', 'I'), ('H', 'J')},...]
  </code></pre>