Enumeration of equicolorable trees (Q2706191)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1578824
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration of equicolorable trees |
scientific article; zbMATH DE number 1578824 |
Statements
19 March 2001
0 references
generating functions
0 references
asymptotic enumeration
0 references
tree
0 references
0 references
0 references
0.89819133
0 references
0 references
0 references
0 references
Enumeration of equicolorable trees (English)
0 references
The author defines a tree to be equicolorable if a proper bicoloring of its vertices assigns the two colors to equal numbers of vertices. It is not difficult to show that the probability that a randomly chosen (rooted or unrooted) \(n\)-vertex labelled tree is equicolorable is asymptotic to two times the probability that its vertices would be equicolored if they were assigned colors by independent coin flips. The author shows that for a randomly chosen (rooted or unrooted) \(n\)-vertex unlabelled tree the corresponding statements holds when two is replaced by \(1.40499\dots\)\ .
0 references
