Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Fete of Combinatorics and Computer ScienceTight Bounds for Embedding Bounded Degree Trees

Fete of Combinatorics and Computer Science: Tight Bounds for Embedding Bounded Degree Trees [Let T be a tree on n vertices with constant maximum degree K. Let G be a graph on n vertices having minimum degree δ(G) ≥ n/2 + ck log n, where CK is a constant. If n is sufficiently large then T ⊂ G. We also show that the bound on the minimum degree of G is tight.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Fete of Combinatorics and Computer ScienceTight Bounds for Embedding Bounded Degree Trees

Part of the Bolyai Society Mathematical Studies Book Series (volume 20)
Editors: Katona, Gyula O. H.; Schrijver, Alexander; Szőnyi, Tamás; Sági, Gábor
Csaba, Béla; Nagy-György, Judit; Levitt, Ian; Szemerédi, Endre
Fete of Combinatorics and Computer Science — Jan 31, 2011
Download PDF
42 pages

Loading next page...
 
/lp/springer-journals/fete-of-combinatorics-and-computer-science-tight-bounds-for-embedding-HaGQybRkC0
Publisher
Springer Berlin Heidelberg
Copyright
© János Bolyai Mathematical Society and Springer-Verlag 2010
ISBN
978-3-642-13579-8
Pages
95 –137
DOI
10.1007/978-3-642-13580-4_5
Publisher site
See Chapter on Publisher Site

Abstract

[Let T be a tree on n vertices with constant maximum degree K. Let G be a graph on n vertices having minimum degree δ(G) ≥ n/2 + ck log n, where CK is a constant. If n is sufficiently large then T ⊂ G. We also show that the bound on the minimum degree of G is tight.]

Published: Jan 31, 2011

Keywords: Bipartite Graph; Minimum Degree; Tight Bound; Embed Line; Dense Pair

There are no references for this article.