1998 KJMO P2 Graph theory Wire/Computer
Source: 1998 KJMO P2
June 30, 2024
graph theorycombinatoricsKJMO
Problem Statement
There are computers(power off) and printers. Between a printer and a computer, they are connected with a wire or not. Printer can be only activated if and only if at least one of the connected computer's power is on. Your goal is to connect wires in such a way that, no matter how you choose three computers to turn on among the six, you can activate all printers. What is the minimum number of wires required to make this possible?