On the infinite Lucchesi–Younger conjecture I

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