The second neighborhood problem

does every oriented graph contain a vertex for which there are at least as many other vertices at distance two as at distance one?

Open the “Miscellaneous graph theory” section on Wikipedia →

Source: List of unsolved problems in mathematics (CC BY-SA 4.0)