48 citations · 169 across the 56 of their papers we have counts for
10 papers · 1 filter
Strongly maximal matchings in infinite weighted graphs
Ron Aharoni, Eli Berger, Agelos Georgakopoulos +1
Given an assignment of weights w to the edges of a graph G, a matching M in G is called strongly w-maximal if for any matching N the sum of weights of the edges in N\M is at most t…
Perfect matchings in r-partite r-graphs
Ron Aharoni, Agelos Georgakopoulos, Philipp Sprüssel
Let H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there exist two sides of H, each satisfying the following condition: the degree of each legal (…
The Max-Flow Min-Cut Theorem for Countable Networks
Ron Aharoni, Eli Berger, Agelos Georgakopoulos +2
We prove a strong version of the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are "orthogonal" to each other…
Geodetic topological cycles in locally finite graphs
Agelos Georgakopoulos, Philipp Sprüssel
We prove that the topological cycle space C(G) of a locally finite graph G is generated by its geodetic topological circles. We further show that, although the finite cycles of G g…
Lamplighter graphs do not admit harmonic functions of finite energy
Agelos Georgakopoulos
We prove that a lamplighter graph of a locally finite graph over a finite graph does not admit a non-constant harmonic function of finite Dirichlet energy.
Uniqueness of electrical currents in a network of finite total resistance
Agelos Georgakopoulos
We show that if the sum of the resistances of an electrical network is finite, then there is a unique electrical current in provided we do not allow, in a sense, any flow t…