Peer-pressuring students into buying tickets
Source: CMO 2023 P2
March 11, 2023
combinatoricsCMOCMO 2023graph theory
Problem Statement
There are 20 students in a high school class, and each student has exactly three close friends in the class. Five of the students have bought tickets to an upcoming concert. If any student sees that at least two of their close friends have bought tickets, then they will buy a ticket too.Is it possible that the entire class buys tickets to the concert?(Assume that friendship is mutual; if student is close friends with student , then is close friends with .)