Huber, K. T., Moulton, V. and Steel, M. (2003) Four characters suffice. In: Proceedings of Formal Power Series and Algebraic Combinatorics FPSAC 2003, 2003-06-23 - 2003-06-27.
Full text not available from this repository. (Request a copy)Abstract
It was recently shown that just five characters (functions on a finite set X) suffice to convexly define a trivalent tree with leaf set X. Here we show that four characters suffice which, since three characters are not general enough, is the best possible.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Faculty \ School: | Faculty of Science > School of Computing Sciences |
Related URLs: | |
Depositing User: | Vishal Gautam |
Date Deposited: | 23 Jul 2011 15:40 |
Last Modified: | 09 Dec 2021 10:08 |
URI: | https://ueaeprints.uea.ac.uk/id/eprint/23803 |
DOI: |
Actions (login required)
![]() |
View Item |