Cyclic Incidence Orderings of Complete Graphs and 3-Uniform Hypergraphs
We study cyclic orderings of all edges of a complete $k$-uniform hypergraph on $n$ vertices in which the binary incidence sequences of the vertices are cyclic shifts of a common word. The shifts are chosen independently, with no prescribed action on the vertices. For $2\leq k<n$, coprimality $\gcd(n,k)=1$ is known to s...