Let G be a 2-connected weighted graph and k >= 2 an integer. In this note we prove that if the sum of the weighted degrees of every k + 1 pairwise nonadjacent vertices is at least m, then G contains either a cycle of weight at least 2m/(k + 1) or a spanning tree with no more than k leaves. (C) 2011 Elsevier Ltd. All rights reserved.
机构:
Princeton Univ, Dept Math, Princeton, NJ 08544 USA
Tel Aviv Univ, Sch Math, IL-69978 Tel Aviv, Israel
Tel Aviv Univ, Sch Comp Sci, IL-69978 Tel Aviv, IsraelPrinceton Univ, Dept Math, Princeton, NJ 08544 USA