Detachments preserving local edge-connectivity of graphs

T. Jordán, Zoltán Szigeti

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

Let G = (V + s, E) be a graph with a designated vertex s of degree d(s), and let f(s) = (d1, d2, ..., dp) be a partition of d(s) into p positive integers. An f(s)-detachment of G is a graph G′ obtained by "splitting" s into p vertices, called the pieces of s, such that the degrees of the pieces of s in G′ are given by f(s). Thus every edge sw ∈ E corresponds to an edge of G′ connecting some piece of s to w. We give necessary and sufficient conditions for the existence of an f(s)-detachment of G in which the local edge-connectivities between pairs of vertices in V satisfy prespecified lower bounds. Our result is a common generalization of a theorem of Mader on edge splittings preserving local edge-connectivities and a result of Fleiner on f(s)-detachments satisfying uniform lower bounds. It implies a conjecture of Fleiner on f(s)-detachments preserving local edge-connectivities. By using our characterization we extend a theorem of Frank on local edge-connectivity augmentation of graphs to the case when stars of given degrees are added, and we also solve the local edge-connectivity augmentation problem for 3-uniform hypergraphs.

Original languageEnglish
Pages (from-to)72-87
Number of pages16
JournalSIAM Journal on Discrete Mathematics
Volume17
Issue number1
DOIs
Publication statusPublished - Sep 2003

Fingerprint

Edge-connectivity
Stars
Graph in graph theory
Augmentation
Lower bound
Uniform Hypergraph
Theorem
Star
Partition
Imply
Necessary Conditions
Integer
Sufficient Conditions
Vertex of a graph

Keywords

  • Detachments of graphs
  • Edge splitting
  • Edge-connectivity

ASJC Scopus subject areas

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Cite this

Detachments preserving local edge-connectivity of graphs. / Jordán, T.; Szigeti, Zoltán.

In: SIAM Journal on Discrete Mathematics, Vol. 17, No. 1, 09.2003, p. 72-87.

Research output: Contribution to journalArticle

@article{df62341ea80d4a6cbfce19e390c9ac6d,
title = "Detachments preserving local edge-connectivity of graphs",
abstract = "Let G = (V + s, E) be a graph with a designated vertex s of degree d(s), and let f(s) = (d1, d2, ..., dp) be a partition of d(s) into p positive integers. An f(s)-detachment of G is a graph G′ obtained by {"}splitting{"} s into p vertices, called the pieces of s, such that the degrees of the pieces of s in G′ are given by f(s). Thus every edge sw ∈ E corresponds to an edge of G′ connecting some piece of s to w. We give necessary and sufficient conditions for the existence of an f(s)-detachment of G in which the local edge-connectivities between pairs of vertices in V satisfy prespecified lower bounds. Our result is a common generalization of a theorem of Mader on edge splittings preserving local edge-connectivities and a result of Fleiner on f(s)-detachments satisfying uniform lower bounds. It implies a conjecture of Fleiner on f(s)-detachments preserving local edge-connectivities. By using our characterization we extend a theorem of Frank on local edge-connectivity augmentation of graphs to the case when stars of given degrees are added, and we also solve the local edge-connectivity augmentation problem for 3-uniform hypergraphs.",
keywords = "Detachments of graphs, Edge splitting, Edge-connectivity",
author = "T. Jord{\'a}n and Zolt{\'a}n Szigeti",
year = "2003",
month = "9",
doi = "10.1137/S0895480199363933",
language = "English",
volume = "17",
pages = "72--87",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "1",

}

TY - JOUR

T1 - Detachments preserving local edge-connectivity of graphs

AU - Jordán, T.

AU - Szigeti, Zoltán

PY - 2003/9

Y1 - 2003/9

N2 - Let G = (V + s, E) be a graph with a designated vertex s of degree d(s), and let f(s) = (d1, d2, ..., dp) be a partition of d(s) into p positive integers. An f(s)-detachment of G is a graph G′ obtained by "splitting" s into p vertices, called the pieces of s, such that the degrees of the pieces of s in G′ are given by f(s). Thus every edge sw ∈ E corresponds to an edge of G′ connecting some piece of s to w. We give necessary and sufficient conditions for the existence of an f(s)-detachment of G in which the local edge-connectivities between pairs of vertices in V satisfy prespecified lower bounds. Our result is a common generalization of a theorem of Mader on edge splittings preserving local edge-connectivities and a result of Fleiner on f(s)-detachments satisfying uniform lower bounds. It implies a conjecture of Fleiner on f(s)-detachments preserving local edge-connectivities. By using our characterization we extend a theorem of Frank on local edge-connectivity augmentation of graphs to the case when stars of given degrees are added, and we also solve the local edge-connectivity augmentation problem for 3-uniform hypergraphs.

AB - Let G = (V + s, E) be a graph with a designated vertex s of degree d(s), and let f(s) = (d1, d2, ..., dp) be a partition of d(s) into p positive integers. An f(s)-detachment of G is a graph G′ obtained by "splitting" s into p vertices, called the pieces of s, such that the degrees of the pieces of s in G′ are given by f(s). Thus every edge sw ∈ E corresponds to an edge of G′ connecting some piece of s to w. We give necessary and sufficient conditions for the existence of an f(s)-detachment of G in which the local edge-connectivities between pairs of vertices in V satisfy prespecified lower bounds. Our result is a common generalization of a theorem of Mader on edge splittings preserving local edge-connectivities and a result of Fleiner on f(s)-detachments satisfying uniform lower bounds. It implies a conjecture of Fleiner on f(s)-detachments preserving local edge-connectivities. By using our characterization we extend a theorem of Frank on local edge-connectivity augmentation of graphs to the case when stars of given degrees are added, and we also solve the local edge-connectivity augmentation problem for 3-uniform hypergraphs.

KW - Detachments of graphs

KW - Edge splitting

KW - Edge-connectivity

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

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

U2 - 10.1137/S0895480199363933

DO - 10.1137/S0895480199363933

M3 - Article

VL - 17

SP - 72

EP - 87

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 1

ER -