PreprintCC BY-NC-ND 4.0arXiv
Highly connected uniquely k-linked digraphs
Abstract
Extending a result of Thomassen, we prove that for every choice of positive integers K≥ k there exist a K-strong digraph which has two disjoint sets S,T each of size k so that the only linkage from S to T in D is the one whose existence follows from Menger's theorem.
Related
- Sharp bounds and extremal structure of minimally strongly k-connected digraphs
- Eccentric Connectivity Index of Cartesian product and Strong product of Strongly Connected Digraphs
- Generating Functions and the Minimum Spectral Radius in Strongly Connected Digraphs with m+2 Edges
- Generating Functions and the Entropy Hierarchy of Strongly Connected Digraphs
- Modulo k-orientations of highly edge-connected signed graphs
BibTeX
@misc{bangjensen2026highly,
title = {{Highly connected uniquely $k$-linked digraphs}},
author = {Jørgen Bang-Jensen},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.06140},
eprint = {2611.06140},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.06140},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - Highly connected uniquely k-linked digraphs
AU - Jørgen Bang-Jensen
PY - 2026
DA - 2026/11/04
PB - arXiv
DO - 10.48550/arxiv.2611.06140
UR - https://arxiv.org/abs/2611.06140
AB - Extending a result of Thomassen, we prove that for every choice of positive integers K≥ k there exist a K-strong digraph which has two disjoint sets S,T each of size k so that the only linkage from S to T in D is the one whose existence follows from Menger's theorem.
ER -