Woodall's conjecture that the minimum number of edges in a dicut of a directed graph is equal to the maximum number of disjoint dijoins.

Open the “Miscellaneous graph theory” section on Wikipedia →

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