Sort indices to groups with all pairs sampled

Hi,

I would to sort a vector of indices

[i = 1 : n]

to groups of size m such that all index pairs appear in at least one group.

For example:

i = 1 : 5;
m = 3;
g =   [ 1    2    3
        1    4    5
        2    4    5
        3    4    5];

The main difficulty for me is to keep the number of groups to a minimum.

Please note that mod(n, m) ~= 0.

Thank you in advance.

Answer 1

[Rik]

It looks like nchoosek should do the trick for you.