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…