activity
20152026
most citedA unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups

6 citations · 16 across the 24 of their papers we have counts for

collaborators
Showing 2018Show all

2 papers · 1 filter

math.CO2018

Characterising -connected sets in infinite graphs

J. Pascal Gollin, Karl Heuer

A -connected set in an infinite graph, where is an integer, is a set of vertices such that any two of its subsets of the same size can be connected by $\el…

math.CO2018

An analogue of Edmonds' Branching Theorem for infinite digraphs

J. Pascal Gollin, Karl Heuer

We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whos…