论文信息 - Bounded size components--partitions and transversals

Bounded size components--partitions and transversals

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.

[1] A. Hajnal,et al. On decomposition of graphs , 1967 .

[2] Noga Alon,et al. Partitioning into graphs with only small components , 2003, J. Comb. Theory, Ser. B.

[3] László Lovász. On decomposition of graphs , 1966 .

[4] Bill Jackson,et al. On the linear k-arboricity of cubic graphs , 1996, Discret. Math..

[5] Raphael Yuster,et al. Independent transversals in r-partite graphs , 1997, Discret. Math..

[6] Endre Szemerédi,et al. On complete subgraphs of r-chromatic graphs , 1975, Discret. Math..

[7] P. Erdos-L Lovász. Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .

[8] 秋山仁,et al. A Short Proof of the Linear Arboricity for Cubic Graphs , 1982 .

[9] Carsten Thomassen. Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5 , 1999, J. Comb. Theory, Ser. B.

[10] Jean-Claude Bermond,et al. On linear k-arboricity , 1984, Discret. Math..

[11] F. Harary,et al. Covering and packing in graphs. III: Cyclic and acyclic invariants , 1980 .

[12] Nicholas C. Wormald,et al. More on the linear k-arboricity of regular graphs , 1998, Australas. J Comb..

[13] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[14] Penny Haxell,et al. A Note on Vertex List Colouring , 2001, Combinatorics, Probability and Computing.