Countable Menger's theorem with finitary matroid constraints on the ingoing edges

Abstract: We present a strengthening of the countable Menger theorem (edge version) of R. Aharoni. Let

D = (V, A)

be a countable digraph with

s e q t i n V

and let

be a matroid on

A

where

m a t h c a l M_{v}

is a finitary matroid on the ingoing edges of

v

. We show that there is a system of edge-disjoint

s i g h t a r r o w t

paths

m a t h c a l P

such that the united edge set of the paths is

m a t h c a l M

-independent, and there is a

C s u b s e t e q A

consists of one edge from each element of

m a t h c a l P

for which

m a t h s f {s p a n}_{m a t h c a l M} (C)

covers all the

s i g h t a r r o w t

paths in

D

.

Full work available at URL: https://arxiv.org/abs/1705.00287

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

Cites Work

Cited In (2)

This page was built for publication: Countable Menger's theorem with finitary matroid constraints on the ingoing edges