Abstract
A tree T uni is m-universal for the class of trees if for every tree T of size m, T can be obtained from T uni by successive contractions of edges.We prove that a m-universal tree for the class of trees has at least mln(m)+(γ-1)m+O(1) edges where γ is the Euler’s constant and we build such a tree with less than m c edges for a fixed constant c = 1.984 . . .
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Rado, Universal graphs and universal functions, Acta Arith., 9 (1964), 331–340.
Z. Füredi and P. Komjàth, Nonexistence of universal graphs without some trees, Combinatorica, 17, (2) (1997), 163–171.
N. Robertson and P.D. Seymour, series of papers on Graph minors, Journal of combinarotics, serie B, (1983-...).
C. Thomassen, Embeddings and Minors, chapter 5 in Handbook of Combinatorics, (R. Graham, M. Grötschel and L. Lovász, eds.), Elsevier Science B.V., 1995, 301–349.
P. Erdös and T. Gallai, On maximal paths and circuits of graphs, Acta Math. Sci. Hungar. 10 (1959), 337–356.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bodini, O. (2002). On the Minimum Size of a Contraction-Universal Tree. In: Goos, G., Hartmanis, J., van Leeuwen, J., Kučera, L. (eds) Graph-Theoretic Concepts in Computer Science. WG 2002. Lecture Notes in Computer Science, vol 2573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36379-3_3
Download citation
DOI: https://doi.org/10.1007/3-540-36379-3_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00331-1
Online ISBN: 978-3-540-36379-8
eBook Packages: Springer Book Archive