48 citations · 71 across the 12 of their papers we have counts for
10 papers · 1 filter
Cubic graphs and related triangulations on orientable surfaces
Wenjie Fang, Mihyun Kang, Michael Moßhammer +1
Let be the orientable surface of genus . We show that the number of vertex-labelled cubic multigraphs embeddable on with vertices is asymptoti…
Characterisation of symmetries of unlabelled triangulations and its applications
Mihyun Kang, Philipp Sprüssel
We give a full characterisation of the symmetries of unlabelled triangulations and derive a constructive decomposition of unlabelled triangulations depending on their symmetries. A…
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…
End spaces of graphs are normal
Philipp Sprüssel
We show that the topological space of any infinite graph and its ends is normal. In particular, end spaces themselves are normal.
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…
Twins of rayless graphs
A. Bonato, H. Bruhn, R. Diestel +1
Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none.
The fundamental group of a locally finite graph with ends
Reinhard Diestel, Philipp Sprüssel
We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding…
Every rayless graph has an unfriendly partition
Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos +1
We prove that every rayless graph has an unfriendly partition.