Four characters suffice

Katharina T. Huber; Vincent Moulton; Mike Steel

Four characters suffice

Katharina T. Huber, Vincent Moulton, Mike Steel

Research output: Contribution to conference › Paper

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 language	English
Pages	133-139
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

Conference	Formal Power Series and Algebraic Combinatorics
Abbreviated title	FPSAC 2003
Country/Territory	Sweden
Period	23/06/03 → 27/06/03

Access to Document

http://www-igm.univ-mlv.fr/~fpsac/FPSAC03/ARTICLES/46.pdf

Cite this

@conference{314c0a855e88484d866538f8ec27c87e,

title = "Four characters suffice",

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.",

author = "Huber, {Katharina T.} and Vincent Moulton and Mike Steel",

year = "2003",

month = jun,

language = "English",

pages = "133--139",

note = "Formal Power Series and Algebraic Combinatorics, FPSAC 2003 ; Conference date: 23-06-2003 Through 27-06-2003",

}

TY - CONF

T1 - Four characters suffice

AU - Huber, Katharina T.

AU - Moulton, Vincent

AU - Steel, Mike

PY - 2003/6

Y1 - 2003/6

N2 - 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.

AB - 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.

M3 - Paper

SP - 133

EP - 139

T2 - Formal Power Series and Algebraic Combinatorics

Y2 - 23 June 2003 through 27 June 2003

ER -