Klaus Draeger
|
Registered User
|
|
|
May 14 |
comment |
two boy scouts problems Your original problem does sound solvable to me (essentially, you need a $(2n-1)$-edge coloring of $K_{2n}$). Is there an additional constraint (e.g. only one match of each sport per round)? |
|
Feb 14 |
comment |
Who knows this convex polytope? No real answer, but I think you want six parallelepipeds, not four. |
