Combinatorics · River crossing puzzle · Conflict graphs · Independent sets · Extremal bound

Problem 5, 2004

RegionalEnter the answer

A merchant has to ferry seven goods across a river: a piece of cheese, a mouse, a rat, a cat, a dog, a wolf and a bear. His boat has room for only \(k\) of the seven at a time. If they are left without him:

the mouse eats the cheese; the rat eats the mouse or the cheese; the cat eats the rat or the mouse; the dog kills the rat or the cat; the wolf kills the dog or the cat; the bear kills the dog or the wolf.

While the merchant is present none of this happens. Determine the smallest \(k\) for which he can be certain of getting all seven goods safely to the other bank.

Sign in to check answers, open hints, read the full solution, and track your progress. Statements are always free.

Serbian Regional Competition (Okruzno takmicenje) 2004, high school grade I, category A, problem 5. Organized by the Mathematical Society of Serbia (DMS). Source

Regional problem · Combinatorics · Lemma