The number of trees with a 1-factor (Q1085165)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The number of trees with a 1-factor |
scientific article; zbMATH DE number 3981188
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of trees with a 1-factor |
scientific article; zbMATH DE number 3981188 |
Statements
The number of trees with a 1-factor (English)
0 references
1987
0 references
A 1-factor in a graph with 2m vertices is a set of m edges no two of which have a common endpoint. This paper enumerates trees with a 1-factor for various families of trees. The main result is, the probability that a tree T on 2m vertices has a 1-factor is asymptotic to \(\alpha \beta^ m\) where \(\alpha\) and \(\beta\) are constants that depend on the family being considered.
0 references
1-factor
0 references
trees
0 references
