1 citations · 3 across the 14 of their papers we have counts for
5 papers · 1 filter
The Lovász-Cherkassky theorem for locally finite graphs with ends
Raphael W. Jacobs, Attila Joó, Paul Knappe +2
Lovász and Cherkassky discovered independently that, if is a finite graph and such that the degree is even for every vertex , t…
Cutting a cake for infinitely many guests
Zsuzsanna Jankó, Attila Joó
Fair division with unequal shares is an intensively studied recourse allocation problem. For , let be an atomless probability measure on the measurable space $(…
Large vertex-flames in uncountable digraphs
Florian Gut, Attila Joó
The study of minimal subgraphs witnessing a connectivity property is an important field in graph theory. The foundation for large flames has been laid by Lovász: Let be…
On the Packing/Covering Conjecture of Infinite Matroids
Attila Joó
The Packing/Covering Conjecture was introduced by Bowler and Carmesin motivated by the Matroid Partition Theorem by Edmonds and Fulkerson. A packing for a family o…
The Lovász-Cherkassky theorem in countable graphs
Attila Joó
Lovász and Cherkassky discovered in the 1970s independently that if is a finite graph with a given set of terminal vertices such that is inner Eulerian, then the…