Four characters suffice

Research output: Contribution to conferencePaper

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.
Original languageEnglish
Pages133-139
Number of pages7
Publication statusPublished - Jun 2003
EventProceedings of Formal Power Series and Algebraic Combinatorics FPSAC 2003 - Linköping University, Sweden
Duration: 23 Jun 200327 Jun 2003

Conference

ConferenceProceedings of Formal Power Series and Algebraic Combinatorics FPSAC 2003
CountrySweden
CityLinköping University
Period23/06/0327/06/03

Cite this