Work

Menger's Theorem in bidirected graphs

Year: 2023

Type: preprint

Abstract: Bidirected graphs are a generalisation of directed graphs that arises in the study of undirected graphs with perfect matchings. Menger's famous theorem - the minimum size of a set separating two vertex sets $X$ and $Y$ is the same as the maximum number of disjoint paths connecting them - is generally not true in bidirected graphs. We introduce a sufficient condition for $X$ and $Y$ which yields a version of Menger's Theorem in bidirected graphs that in particular implies its directed counterpart.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2306.01921

Authors: Bowler, Nathan, Ghorbani, Ebrahim, Gut, Florian, Jacobs, Raphael W., Reich, Florian

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Alexander von Humboldt-Stiftung, Studienstiftung des Deutschen Volkes, Universität Hamburg

OpenAlex ID: W4379538646

Cites:

Cited by:

Related to: 10