cture about finite partially ordered sets P with a top element such that no element has more than b lower covers: which one has the fewest cutsets? Vasek Chvatal and three computer scientists at McGill University proved a special case of the conjecture, for trees. They heard the question in a talk I gave at M