Menger-type theorems with restrictions on path lengths

László Pyber, Z. Tuza

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

If the paths of length ≤s, joining two non-adjacent vertices u, υ of a graph cannot be destroyed by deleting less than t vertices, then there are at least t internally vertex-disjoint paths joining u and υ, each having length less than ( t+s-2 s-2)+( t+s-3 s-2). Some constructions show that using paths of length at least s t-1t might be necessary.

Original languageEnglish
Pages (from-to)161-174
Number of pages14
JournalDiscrete Mathematics
Volume120
Issue number1-3
DOIs
Publication statusPublished - Sep 12 1993

Fingerprint

Path Length
Joining
Restriction
Theorem
Path
Disjoint Paths
Necessary
Graph in graph theory
Vertex of a graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Menger-type theorems with restrictions on path lengths. / Pyber, László; Tuza, Z.

In: Discrete Mathematics, Vol. 120, No. 1-3, 12.09.1993, p. 161-174.

Research output: Contribution to journalArticle

Pyber, László ; Tuza, Z. / Menger-type theorems with restrictions on path lengths. In: Discrete Mathematics. 1993 ; Vol. 120, No. 1-3. pp. 161-174.
@article{00d2b83dddf6410c80712817b24d18ed,
title = "Menger-type theorems with restrictions on path lengths",
abstract = "If the paths of length ≤s, joining two non-adjacent vertices u, υ of a graph cannot be destroyed by deleting less than t vertices, then there are at least t internally vertex-disjoint paths joining u and υ, each having length less than ( t+s-2 s-2)+( t+s-3 s-2). Some constructions show that using paths of length at least s t-1t might be necessary.",
author = "L{\'a}szl{\'o} Pyber and Z. Tuza",
year = "1993",
month = "9",
day = "12",
doi = "10.1016/0012-365X(93)90573-C",
language = "English",
volume = "120",
pages = "161--174",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Menger-type theorems with restrictions on path lengths

AU - Pyber, László

AU - Tuza, Z.

PY - 1993/9/12

Y1 - 1993/9/12

N2 - If the paths of length ≤s, joining two non-adjacent vertices u, υ of a graph cannot be destroyed by deleting less than t vertices, then there are at least t internally vertex-disjoint paths joining u and υ, each having length less than ( t+s-2 s-2)+( t+s-3 s-2). Some constructions show that using paths of length at least s t-1t might be necessary.

AB - If the paths of length ≤s, joining two non-adjacent vertices u, υ of a graph cannot be destroyed by deleting less than t vertices, then there are at least t internally vertex-disjoint paths joining u and υ, each having length less than ( t+s-2 s-2)+( t+s-3 s-2). Some constructions show that using paths of length at least s t-1t might be necessary.

UR - http://www.scopus.com/inward/record.url?scp=43949172049&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=43949172049&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(93)90573-C

DO - 10.1016/0012-365X(93)90573-C

M3 - Article

VL - 120

SP - 161

EP - 174

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -