On the number of decomposable trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2006

On the number of decomposable trees

Abstract

A tree is called $k$-decomposable if it has a spanning forest whose components are all of size $k$. Analogously, a tree is called $T$-decomposable for a fixed tree $T$ if it has a spanning forest whose components are all isomorphic to $T$. In this paper, we use a generating functions approach to derive exact and asymptotic results on the number of $k$-decomposable and $T$-decomposable trees from a so-called simply generated family of trees - we find that there is a surprisingly simple functional equation for the counting series of $k$-decomposable trees. In particular, we will study the limit case when $k$ goes to $\infty$. It turns out that the ratio of $k$-decomposable trees increases when $k$ becomes large.
Fichier principal
Vignette du fichier
dmAG0121.pdf (185.86 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184701 , version 1 (17-08-2015)

Identifiers

Cite

Stephan G. Wagner. On the number of decomposable trees. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.301-308, ⟨10.46298/dmtcs.3497⟩. ⟨hal-01184701⟩

Collections

INSMI TDS-MACS
37 View
404 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More