Hindrance from a wasteful partial linkage

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Joó, Attila
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916783254929408
author Joó, Attila
author_facet Joó, Attila
contents Let $ D=(V,E) $ be a (possibly infinite) digraph and $ A,B\subseteq V $. A hindrance consists of an $ AB $-separator $ S $ together with a set of disjoint $ AS $-paths linking a proper subset of $ A $ onto $ S $. Hindrances and configurations guaranteeing the existence of hindrances play an essential role in the proof of the infinite version of Menger's theorem and are important in the context of certain open problems as well. This motivates the investigation of circumstances under which hindrances appear. In this paper we show that if there is a ``wasteful partial linkage'', i.e. a set $ \mathcal{P} $ of disjoint $ AB $-paths with fewer unused vertices in $ B $ than in $ A $, then there exists a hindrance.
format Preprint
id arxiv_https___arxiv_org_abs_2410_19583
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Hindrance from a wasteful partial linkage
Joó, Attila
Combinatorics
Let $ D=(V,E) $ be a (possibly infinite) digraph and $ A,B\subseteq V $. A hindrance consists of an $ AB $-separator $ S $ together with a set of disjoint $ AS $-paths linking a proper subset of $ A $ onto $ S $. Hindrances and configurations guaranteeing the existence of hindrances play an essential role in the proof of the infinite version of Menger's theorem and are important in the context of certain open problems as well. This motivates the investigation of circumstances under which hindrances appear. In this paper we show that if there is a ``wasteful partial linkage'', i.e. a set $ \mathcal{P} $ of disjoint $ AB $-paths with fewer unused vertices in $ B $ than in $ A $, then there exists a hindrance.
title Hindrance from a wasteful partial linkage
topic Combinatorics
url https://arxiv.org/abs/2410.19583