Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-15T06:40:03.041Z Has data issue: false hasContentIssue false
  • English
  • Français

On Subtrees of Directed Graphs with No Path of Length Exceeding One

Published online by Cambridge University Press:  20 November 2018

R. L. Graham
R. L. Graham*
Affiliation:
Bell Telephone Laboratories, Inc., Murray Hill, New Jersey
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The following theorem was conjectured to hold by P. Erdös [1]:

Theorem 1. For each finite directed tree T with no directed path of length 2, there exists a constant c(T) such that if G is any directed graph with n vertices and at least c(T)n edges and n is sufficiently large, then T is a subgraph of G.

In this note we give a proof of this conjecture. In order to prove Theorem 1, we first need to establish the following weaker result.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 13 , Issue 3 , September 1970 , pp. 329 - 332
Copyright
Copyright © Canadian Mathematical Society 1970

References

1. Erdös, P., (personal communication).Google Scholar