Bounded size components - Partitions and transversals

Penny Haxell, Tibor Szabó, G. Tardos

Research output: Contribution to journalArticle

30 Citations (Scopus)

Abstract

Answering a question of Alon et al., we show that there exists an absolute constant C such that every graph G with maximum degree 5 has a vertex partition into 2 parts, such that the subgraph induced by each part has no component of size greater than C. We obtain similar results for partitioning graphs of given maximum degree into k parts (k > 2) as well. A related theorem is also proved about transversals inducing only small components in graphs of a given maximum degree.

Original languageEnglish
Pages (from-to)281-297
Number of pages17
JournalJournal of Combinatorial Theory. Series B
Volume88
Issue number2
DOIs
Publication statusPublished - Jul 2003

Fingerprint

Transversals
Maximum Degree
Partition
Vertex Partition
Graph Partitioning
Induced Subgraph
Graph in graph theory
Theorem

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Bounded size components - Partitions and transversals. / Haxell, Penny; Szabó, Tibor; Tardos, G.

In: Journal of Combinatorial Theory. Series B, Vol. 88, No. 2, 07.2003, p. 281-297.

Research output: Contribution to journalArticle

Haxell, Penny ; Szabó, Tibor ; Tardos, G. / Bounded size components - Partitions and transversals. In: Journal of Combinatorial Theory. Series B. 2003 ; Vol. 88, No. 2. pp. 281-297.
@article{1428f58f8f194b88b6a92a35d41ea134,
title = "Bounded size components - Partitions and transversals",
abstract = "Answering a question of Alon et al., we show that there exists an absolute constant C such that every graph G with maximum degree 5 has a vertex partition into 2 parts, such that the subgraph induced by each part has no component of size greater than C. We obtain similar results for partitioning graphs of given maximum degree into k parts (k > 2) as well. A related theorem is also proved about transversals inducing only small components in graphs of a given maximum degree.",
author = "Penny Haxell and Tibor Szab{\'o} and G. Tardos",
year = "2003",
month = "7",
doi = "10.1016/S0095-8956(03)00031-5",
language = "English",
volume = "88",
pages = "281--297",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Bounded size components - Partitions and transversals

AU - Haxell, Penny

AU - Szabó, Tibor

AU - Tardos, G.

PY - 2003/7

Y1 - 2003/7

N2 - Answering a question of Alon et al., we show that there exists an absolute constant C such that every graph G with maximum degree 5 has a vertex partition into 2 parts, such that the subgraph induced by each part has no component of size greater than C. We obtain similar results for partitioning graphs of given maximum degree into k parts (k > 2) as well. A related theorem is also proved about transversals inducing only small components in graphs of a given maximum degree.

AB - Answering a question of Alon et al., we show that there exists an absolute constant C such that every graph G with maximum degree 5 has a vertex partition into 2 parts, such that the subgraph induced by each part has no component of size greater than C. We obtain similar results for partitioning graphs of given maximum degree into k parts (k > 2) as well. A related theorem is also proved about transversals inducing only small components in graphs of a given maximum degree.

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

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

U2 - 10.1016/S0095-8956(03)00031-5

DO - 10.1016/S0095-8956(03)00031-5

M3 - Article

AN - SCOPUS:0038687994

VL - 88

SP - 281

EP - 297

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 2

ER -