On the number of transversals in random 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 : 2012

On the number of transversals in random trees

Abstract

We study transversals in random trees with n vertices asymptotically as n tends to infinity. Our investigation treats the average number of transversals of fixed size, the size of a random transversal as well as the probability that a random subset of the vertex set of a tree is a transversal for the class of simply generated trees and for Pólya trees. The last parameter was already studied by Devroye for simply generated trees. We offer an alternative proof based on generating functions and singularity analysis and extend the result to Pólya trees.
Fichier principal
Vignette du fichier
dmAQ0112.pdf (297.09 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01197246 , version 1 (11-09-2015)

Identifiers

Cite

Bernhard Gittenberger, Veronika Kraus. On the number of transversals in random trees. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), 2012, Montreal, Canada. pp.141-154, ⟨10.46298/dmtcs.2990⟩. ⟨hal-01197246⟩

Collections

TDS-MACS
129 View
655 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More