###
Petersburg Department of Steklov Institute of Mathematics

#
PREPRINT 12/2000

ä.÷.ëÁÒÐÏ×
##
ïóôï÷îïå äåòå÷ï ó âïìøûéí ëïìéþåóô÷ïí ÷éóñþéè ÷åòûéî

This preprint was accepted ÓÅÎÔÑÂÒØ 2000

Contact:
` ä.÷.ëÁÒÐÏ× `

ABSTRACT:
We will prove that for every connect graph~$G(V,E)$ with no two adjacent
vertices of degree~2 exists a spanning tree with more than~$|V|\over5$
end vertices and describe the method of constructing such a tree.
We will prove that the constant~${1\over5}$ can't be replaced with
bigger.

[ Full text:
(.ps.gz)]

Back to all preprints

Back to the Petersburg Department of Steklov
Institute of Mathematics