Title of article
All trees contain a large induced subgraph having all degrees 1 (mod k) Original Research Article
Author/Authors
David M. Berman، نويسنده , , A.J. Radcliffe، نويسنده , , A.D. Scott، نويسنده , , Hong Wang، نويسنده , , Larry Wargo، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
6
From page
35
To page
40
Abstract
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.
Journal title
Discrete Mathematics
Serial Year
1997
Journal title
Discrete Mathematics
Record number
951634
Link To Document