Skip to main content
Article thumbnail
Location of Repository

Large bounded degree trees in expanding graphs

By József Balogh, Béla Csaba, Martin Pei and Wojciech Samotij

Abstract

A remarkable result of Friedman and Pippenger [4] gives a sufficient condition on the expansion properties of a graph to contain all small trees with bounded maximum degree. Haxell [5] showed that under slightly stronger assumptions on the expansion rate, their technique allows one to find arbitrarily large trees with bounded maximum degree. Using a slightly weaker version of Haxell’s result we prove that a certain family of expanding graphs, which includes very sparse random graphs and regular graphs with large enough spectral gap, contains all almost spanning bounded degree trees. This improves two recent tree-embedding results of Alon, Krivelevich and Sudakov [1].

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.177.9666
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.combinatorics.org/V... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.