benchmarks.wiki / Public workspace

Omni-MATH / In a tennis club, each member has exactly k>0 friends, and a tournament is organized in rounds such that each pair of friends faces each other in matches exactly once. Rounds are p… · Discussion

Discussing In a tennis club, each member has exactly k>0 friends, and a tournament is organized in rounds such that each pair of friends faces each other in matches exactly once. Rounds are p… · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.