Hamilton Cycles in Digraphs of Unitary Matrices
arXiv:math/0409228
Abstract
A set is called an {\em -set} ({\em -set}, respectively) if has at least two vertices and, for every , there exists such that (, respectively). A digraph is called {\em s-quadrangular} if, for every -set , we have and, for every -set , we have . We conjecture that every strong s-quadrangular digraph has a Hamilton cycle and provide some support for this conjecture.
8 pages