Showing 2023Show all
3 papers · 1 filter
math.CO2023
Polynomial Reconstruction Problem for Hypergraphs
Joshua Cooper, Utku Okur
We show that, in general, the characteristic polynomial of a hypergraph is not determined by its ``polynomial deck'', the multiset of characteristic polynomials of its vertex-delet…
math.CO2023
Decks of rooted binary trees
Ann Clifton, Eva Czabarka, Audace Dossou-Olory +5
We consider extremal problems related to decks and multidecks of rooted binary trees (a.k.a. rooted phylogenetic tree shapes). Here, the deck (resp. multideck) of a tree refers…
math.CO2023
Universal rooted phylogenetic tree shapes and universal tanglegrams
Ann Clifton, Eva Czabarka, Kevin Liu +4
We provide an lower bound and an upper bound for the smallest size of rooted binary trees (a.k.a. phylogenetic tree shapes), which are universal for rooted b…