### 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 + C_{K} 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.

Original language | English |
---|---|

Title of host publication | Fete of Combinatorics and Computer Science |

Pages | 95-137 |

Number of pages | 43 |

DOIs | |

Publication status | Published - Dec 1 2010 |

Event | Meeting on Fete of Combinatorics and Computer Science - Keszthely, Hungary Duration: Aug 11 2008 → Aug 15 2008 |

### Publication series

Name | Bolyai Society Mathematical Studies |
---|---|

Volume | 20 |

ISSN (Print) | 1217-4696 |

ISSN (Electronic) | 1217-4696 |

### Other

Other | Meeting on Fete of Combinatorics and Computer Science |
---|---|

Country | Hungary |

City | Keszthely |

Period | 8/11/08 → 8/15/08 |

### ASJC Scopus subject areas

- Computational Theory and Mathematics
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Tight bounds for embedding bounded degree trees'. Together they form a unique fingerprint.

## Cite this

Csaba, B., Levitt, I., Nagy-György, J., & Szemerédi, E. (2010). Tight bounds for embedding bounded degree trees. In

*Fete of Combinatorics and Computer Science*(pp. 95-137). (Bolyai Society Mathematical Studies; Vol. 20). https://doi.org/10.1007/978-3-642-13580-4_5