On the infinite Lucchesi–Younger conjecture I
A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the cut. A famous theorem of Lucchesi and Younger states that in every finite digraph the least size of an edge set meeting every dicut equals the maximum number of disjoint dicuts in that digraph. In this first paper out of a series of two papers, we conjecture a version of this theorem using a more structural description of this min‐max property for finite dicuts in infinite digraphs. We show that this conjecture can be reduced to countable digraphs where the underlying undirected graph is 2‐connected, and we prove several special cases of the conjecture.