OFFSET
1,2
COMMENTS
Storing an arbitrary unlabeled tree with n nodes takes an information-theoretic minimum of kn + O(log n) bits, where k = 1.56... is this constant. (This holds for either rooted or unrooted trees.)
LINKS
EXAMPLE
1.5635317110705585107388790386780639226978373228899412789280067949381657802...
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
Charles R Greathouse IV, Jun 09 2016
STATUS
approved