Social golfer problem

Mathematics problem

In discrete mathematics, the social golfer problem (SGP) is a combinatorial-design problem derived from a question posted in the usenet newsgroup sci.op-research in May 1998. The problem is as follows: 32 golfers play golf once a week in groups of 4. Schedule these golfers to play for as many weeks as possible without any two golfers playing together in a group more than once.

This keyword could refer to multiple things. Here are some suggestions: