✦ LIBER ✦

An end-faithful spanning tree counterexample

✍ Scribed by Paul Seymour; Robin Thomas

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 980 KB
Volume: 95
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90344-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

End-faithful spanning trees inT1-free gr

End-faithful spanning trees inT1-free graphs

✍ Polat, Norbert 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB 👁 1 views

We prove that any connected graph that contains no subdivision of an ℵ 1regular tree has an end-faithful spanning tree; and furthermore that it has a rayless spanning tree if all its ends are dominated. This improves a result of Seymour and Thomas (An end-faithful spanning tree counterexample, Discr

Ends in spanning trees

✍ Xingxing Yu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 97 KB

We refer to for terminology not specified here. Graphs mentioned in this note are undirected, simple. The following definition is due to Halin [l]: an end E of an infinite graph G is a set of l-way infinite paths in G such that P, Q E E iff for any finite subset R of V(G) there is a finite path in

Interpolation theorem for the number of

Interpolation theorem for the number of end-vertices of spanning trees

✍ Seymour Schuster 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB 👁 1 views

## Abstract The following interpolation theorem is proved: If a graph __G__ contains spanning trees having exactly __m__ and __n__ end‐vertices, with __m__ < __n__, then for every integer __k, m < k < n, G__ contains a spanning tree having exactly __k__ end‐vertices. This settles a problem posed by

Graphs with an extremal number of spanni

Graphs with an extremal number of spanning trees

✍ A. K. Kelmans 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

Minimal spanning trees: An empirical inv

Minimal spanning trees: An empirical investigation of parallel algorithms

✍ R.S Barr; R.V Helgaon; J.L Kennington 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 440 KB

A lower bound on the number of spanning

A lower bound on the number of spanning trees with k end-vertices

✍ Katherine Heinrich; Guizhen Liu 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 1 views

If a graph G with cycle rank p contains both spanning trees with rn and with n end-vertices, rn < n, then G has at least 2p spanning trees with k end-vertices for each integer k, rn < k < n. Moreover, the lower bound of 2p is best possible. [ l ] and Schuster [4] independently proved that such span