𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On graphs which contain each tree of given size

✍ Scribed by Jean-François Saclé; Mariusz Woźniak

Book ID
104114062
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
393 KB
Volume
165-166
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

graph with girth no less than 2t + 1 and minimum degree no less than k/t and d(T), then G contains each tree T of size k.

It is known that this conjecture holds for t = 1 and t = 2. We prove it in the case t = 3.

📜 SIMILAR VOLUMES

On the size of graphs of a given bandwid
On the size of graphs of a given bandwidth
✍ Ronald D. Dutton; Robert C. Brigham 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 489 KB

The relationship between the graphical invariants bandwidth and number of edges is considered. Bounds, some sharp and others improvements of known results, are given for the nznber of edges of graphs having a given bandwidth. An important invariant of undirected graphs having no loops or multiple e

On extremal sizes of locallyk-tree graph
On extremal sizes of locallyk-tree graphs
✍ Mieczysław Borowiecki; Piotr Borowiecki; Elżbieta Sidorowicz; Zdzisław Skupień 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 250 KB