olymmath

US-TST 2001 Problem 4

    There are 51 senators in a senate. The senate needs to be divided into nn committees so that each senator is on one committee. Each senator hates exactly three other senators. (If senator A hates senator B, then senator B does not necessarily hate senator A.) Find the smallest nn such that it is always possible to arrange the committees so that no senator hates another senator on his or her committee.

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator us-tst/2001/p4 · Tag G319QEF1XT · Edit this page on GitHub · Keys: j next, k previous