𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Expanding graphs contain all small trees

✍ Scribed by Joel Friedman; Nicholas Pippenger

Book ID
110564251
Publisher
Springer-Verlag
Year
1987
Tongue
English
Weight
299 KB
Volume
7
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs with all spanning trees nonisomor
Graphs with all spanning trees nonisomorphic
✍ Lars DΓΈvling Andersen; Preben Dahl Vestergaard πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 487 KB

The paper presents some results on graphs that do not have two distinct isomorphic spanning trees. It is proved that any such connected graph with at least two vertices must have the property that each end-block has just one edge. On the other hand, the class of such graphs is quite large; it is sho

All trees contain a large induced subgra
All trees contain a large induced subgraph having all degrees 1 (mod k)
✍ David M. Berman; A.J. Radcliffe; A.D. Scott; Hong Wang; Larry Wargo πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 260 KB

We prove that, for integers n/>2 and k~>2, every tree with n vertices contains an induced subgraph of order at least 2/(n + 2k -3)/(2k -1)j with all degrees congruent to 1 modulo k. This extends a result of Radcliffe and Scott, and answers a question of Caro et al.

Small order graph-tree Ramsey numbers
Small order graph-tree Ramsey numbers
✍ R.J. Faudree; C.C. Rousseau; R.H. Schelp πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 521 KB

With but a few exceptions, the Ramsey number r(G, T) is determined for all connected graphs G with at most five vertices and all trees T.