Tight Euler tours in uniform hypergraphs - computational aspects

Zbigniew Lonc, Paweł Naroski, Paweł Rzążewski

By a tight tour in a $k$-uniform hypergraph $H$ we mean any sequence of its vertices $(w_0,w_1,\dots ,w_{s-1})$ such that for all $i=0,\dots ,s-1$ the set $e_i=\{w_i,w_{i+1}\ldots,…