1 citations · 3 across the 14 of their papers we have counts for
4 papers · 1 filter
Vertex-flames in countable rooted digraphs preserving an Erdős-Menger separation for each vertex
Attila Joó
It follows from a theorem of Lovász that if is a finite digraph with then there is a spanning subdigraph of such that for every vertex t…
Independent and maximal branching packing in infinite matroid-rooted digraphs
Attila Joó
We prove a common generalization of the maximal independent arborescence packing theorem of Cs. Király and two of our earlier works about packing branchings in infinite digraphs.
T-joins in infinite graphs as edge-disjoint system of paths matching the vertices in
Attila Joó
We characterize the class of infinite connected graphs for which there exists a -join for any choice of an infinite . We also show that the following…
On partitioning the edges of an infinite digraph into directed cycles
Attila Joó
Nash-Williams proved that for an undirected graph the set can be partitioned into cycles if and only if every cut has either even or infinite number of edges. Later…