TY - JOUR
T1 - Partitioning H-minor free graphs into three subgraphs with no large components
AU - Liu, Chun Hung
AU - Oum, Sang il
N1 - Funding Information:
Supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No. NRF-2017R1A2B4005020).
Publisher Copyright:
© 2017 Elsevier Inc.
PY - 2018/1
Y1 - 2018/1
N2 - We prove that for every graph H, if a graph G has no (odd) H minor, then its vertex set V(G) can be partitioned into three sets X1, X2, X3 such that for each i, the subgraph induced on Xi has no component of size larger than a function of H and the maximum degree of G. This improves a previous result of Alon, Ding, Oporowski and Vertigan (2003) [1] stating that V(G) can be partitioned into four such sets if G has no H minor. Our theorem generalizes a result of Esperet and Joret (2014) [9], who proved it for graphs embeddable on a fixed surface and asked whether it is true for graphs with no H minor. As a corollary, we prove that for every positive integer t, if a graph G has no Kt+1 minor, then its vertex set V(G) can be partitioned into 3t sets X1,…,X3t such that for each i, the subgraph induced on Xi has no component of size larger than a function of t. This corollary improves a result of Wood (2010) [21], which states that V(G) can be partitioned into ⌈3.5t+2⌉ such sets.
AB - We prove that for every graph H, if a graph G has no (odd) H minor, then its vertex set V(G) can be partitioned into three sets X1, X2, X3 such that for each i, the subgraph induced on Xi has no component of size larger than a function of H and the maximum degree of G. This improves a previous result of Alon, Ding, Oporowski and Vertigan (2003) [1] stating that V(G) can be partitioned into four such sets if G has no H minor. Our theorem generalizes a result of Esperet and Joret (2014) [9], who proved it for graphs embeddable on a fixed surface and asked whether it is true for graphs with no H minor. As a corollary, we prove that for every positive integer t, if a graph G has no Kt+1 minor, then its vertex set V(G) can be partitioned into 3t sets X1,…,X3t such that for each i, the subgraph induced on Xi has no component of size larger than a function of t. This corollary improves a result of Wood (2010) [21], which states that V(G) can be partitioned into ⌈3.5t+2⌉ such sets.
KW - Graph minors
KW - Odd minors
KW - Small components
KW - Vertex partitions
UR - http://www.scopus.com/inward/record.url?scp=85028361103&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85028361103&partnerID=8YFLogxK
U2 - 10.1016/j.jctb.2017.08.003
DO - 10.1016/j.jctb.2017.08.003
M3 - Article
AN - SCOPUS:85028361103
SN - 0095-8956
VL - 128
SP - 114
EP - 133
JO - Journal of Combinatorial Theory. Series B
JF - Journal of Combinatorial Theory. Series B
ER -