Let X be a finite set. We give a criterion to say if a system of trees P={T_i}_i with leaf sets L(T_i) \in {X \choose 5} can be amalgamated into a supertree, that is, if there exists a tree T withL(T)=X such that T restricted to L(T_i) is equal to T_i.
Treelike quintet systems / Calamai, Simone; Rubei, Elena. - In: SÉMINAIRE LOTHARINGIEN DE COMBINATOIRE. - ISSN 1286-4889. - STAMPA. - 76:(2016), pp. 0-0.
Treelike quintet systems
CALAMAI, SIMONE;RUBEI, ELENA
2016
Abstract
Let X be a finite set. We give a criterion to say if a system of trees P={T_i}_i with leaf sets L(T_i) \in {X \choose 5} can be amalgamated into a supertree, that is, if there exists a tree T withL(T)=X such that T restricted to L(T_i) is equal to T_i.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
