Vertex-Flames in Countable Rooted Digraphs Preserving an Erdős-Menger Separation for Each Vertex


It follows from a theorem of Lovász that if D is a finite digraph with rV(D), then there is a spanning subdigraph E of D such that for every vertex v ≠ r the following quantities are equal: the local connectivity from r to v in D, the local connectivity from r to v in E and the indegree of v in E.

In infinite combinatorics cardinality is often an overly rough measure to obtain deep results and it is more fruitful to capture structural properties instead of just equalities between certain quantities. The best known example for such a result is the generalization of Menger's theorem to infinite digraphs. We generalize the result of Lovász above in this spirit. Our main result is that every countable r-rooted digraph D has a spanning subdigraph E with the following property. For every v ≠ r, E contains a system Rv of internally disjoint r → v paths such that the ingoing edges of v in E are exactly the last edges of the paths in Rv. Furthermore, the path-system Rv is “big” in D in the Erdős-Menger sense, i.e., one can choose from each path in Rv either an edge or an internal vertex in such a way that a resulting set separates v from r in D.

This is a preview of subscription content, access via your institution.


  1. [1]

    R. Aharoni and E. Berger: Menger's theorem for infinite graphs, Invent. Math.176 (2009), 1–62.

    MathSciNet  Article  Google Scholar 

  2. [2]

    R. Diestel: Graph theory, Graduate Texts in Mathematics 173, 5, Springer, Berlin, 2017.

    MATH  Google Scholar 

  3. [3]

    G. Calvillo-Vives: Optimum branching systems, 1978, (Ph.D. Thesis), University of Waterloo.

    Google Scholar 

  4. [4]

    L. Lovász: Connectivity in digraphs, J. Combinatorial Theory Ser. B15 (1973), 174–177.

    MathSciNet  Article  Google Scholar 

  5. [5]

    J. S. Pym: The linking of sets in graphs, J. London Math. Soc.44 (1969), 542–550.

    MathSciNet  Article  Google Scholar 

  6. [6]

    D. T. Soukup and L. Soukup: Infinite combinatorics plain and simple, J. Symb. Log.83 (2018), 1247–1281.

    MathSciNet  Article  Google Scholar 

Download references

Author information



Corresponding author

Correspondence to Attila Joó.

Additional information

The research was supported by OTKA 113047.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Joó, A. Vertex-Flames in Countable Rooted Digraphs Preserving an Erdős-Menger Separation for Each Vertex. Combinatorica 39, 1317–1333 (2019).

Download citation

Mathematics Subject Classification (2010)

  • 05C63
  • 05C20
  • 05C40