Spanning trees with many leaves

  • Authors:

  • Guoli Ding;Thor Johnson;Paul Seymour

  • Affiliations:

  • Department of Mathematics, Louisiana State University, Baton Rouge, La 70803;Department of Mathematics, Princeton University, Princeton, NJ 08544;Department of Mathematics, Princeton University, Princeton, NJ 08544

  • Venue:
  • Journal of Graph Theory
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We show that if G is a simple connected graph with $$|E\;({\bf G})|\geq |V\;(\,G)|+{1 \over 2}t\,\;(t-1)$$ and $|V(G)| \,\neq\,t+2$, then G has a spanning tree with  t leaves, and this is best possible. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 189–197, 2001