## Abstract

Let H_{n} be the class of vertex-rooted unlabeled trees with n vertices, and denote by H_{n} a tree that is drawn uniformly at random from this set. In this work we study the number deg_{k} (H_{n}) of vertices of degree k in H_{n}. In particular, for k = O ((frac(log n, log log n))^{1 / 2}) we show exponential-type bounds for the probability that deg_{k} (H_{n}) deviates from its expectation. On the technical side, our proofs are based on the analysis of a randomized algorithm that generates unlabeled trees in the so-called Boltzmann model. The analysis of such algorithms is quite well-understood for classes of labeled graphs. Comparable algorithms for unlabeled classes are unfortunately much more complex. We demonstrate in this work that they can be analyzed very precisely for classes of unlabeled graphs as well.

Original language | English (US) |
---|---|

Pages (from-to) | 41-45 |

Number of pages | 5 |

Journal | Electronic Notes in Discrete Mathematics |

Volume | 34 |

DOIs | |

State | Published - Aug 1 2009 |

Externally published | Yes |

## Keywords

- Boltzmann Sampling
- Degree Sequence
- Random Unlabeled Trees

## ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Applied Mathematics