论文信息 - All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k)

We prove that, for integers n ? 2 and k ? 2, every tree with n vertices contains an induced subgraph of order at least 2?(n + 2k ? 3)/(2k ? 1)? with all degrees congruent to 1 modulo k. This extends a result of Radcliffe and Scott, and answers a question of Caro et al.

Hong Wang | Alex D. Scott | A. J. Radcliffe | David M. Berman | Larry Wargo

[1] Yair Caro,et al. On induced subgraphs of trees, with restricted degrees , 1994, Discret. Math..

[2] Yair Caro. On induced subgraphs with odd degrees , 1994, Discret. Math..

[3] L. Lovász. Combinatorial problems and exercises , 1979 .

[4] Alex D. Scott,et al. Every tree contains a large induced subgraph with all degrees odd , 1995, Discret. Math..

[5] Alex D. Scott. Large Induced Subgraphs with All Degrees Odd , 1992, Comb. Probab. Comput..