20 citations · 118 across the 29 of their papers we have counts for
3 papers · 1 filter
Finding topological subgraphs is fixed-parameter tractable
Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx +1
We show that for every fixed undirected graph , there is a time algorithm that tests, given a graph , if contains as a topological subgraph (that is, a…
The Erdös-Pósa property for clique minors in highly connected graphs
Reinhard Diestel, Ken-ichi Kawarabayashi, Paul Wollan
We prove the existence of a function f: N^2 -> N such that for all p,k in N every (k(p-3) + 14p+14) - connected graph either has k disjoint K_p minors or contains a set of at most…
Axioms for infinite matroids
Henning Bruhn, Reinhard Diestel, Matthias Kriesell +2
We give axiomatic foundations for non-finitary infinite matroids with duality, in terms of independent sets, bases, circuits, closure and rank. This completes the solution to a pro…