Junsheng Liu

collaborators

2 papers

math.CO2023

The largest crossing number of tanglegrams

Éva Czabarka, Junsheng Liu, László A. Székely

A tanglegram $T$ consists of two rooted binary trees with the same number of leaves, and a perfect matching between the two leaf sets. In a layout, the tanglegrams is drawn wi…

math.CO2020

Set-Sequential Labelings of Odd Trees

Emily Eckels, Ervin Gyori, Junsheng Liu +1

A tree $T$ on $2^{n}$ vertices is called set-sequential if the elements in $V (T) \cup E (T)$ can be labeled with distinct nonzero $(n + 1)$ -dimensional $01$ -vectors such that the vector…