Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-27T21:09:32.484Z Has data issue: false hasContentIssue false
  • English
  • Français

Spanning Trees in Dense Graphs

Published online by Cambridge University Press:  12 December 2001

JÁNOS KOMLÓS ,
GÁBOR N. SÁRKÓZY  and
ENDRE SZEMERÉDI
JÁNOS KOMLÓS
Affiliation:
Department of Mathematics, Rutgers University, Piscataway, NJ 08854, USA
GÁBOR N. SÁRKÓZY
Affiliation:
Computer Science Department, Worcester Polytechnic Institute, Worcester, MA 01609, USA
ENDRE SZEMERÉDI
Affiliation:
Department of Mathematics, Rutgers University, Piscataway, NJ 08854, USA Hungarian Academy of Sciences, Budapest, Hungary
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we prove the following almost optimal theorem. For any δ > 0, there exist constants c and n0 such that, if n [ges ] n0, T is a tree of order n and maximum degree at most cn/log n, and G is a graph of order n and minimum degree at least (1/2 + δ)n, then T is a subgraph of G.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 10 , Issue 5 , September 2001 , pp. 397 - 416
Copyright
2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)