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.
|Number of pages||7|
|Publication status||Published - Jun 2003|
|Event||Formal Power Series and Algebraic Combinatorics - Linköping University, Sweden|
Duration: 23 Jun 2003 → 27 Jun 2003
|Conference||Formal Power Series and Algebraic Combinatorics|
|Abbreviated title||FPSAC 2003|
|Period||23/06/03 → 27/06/03|