n-graphs, games of n players and the Delta-conjecture

The notion of an n-graph is introduced, and certain properties and applications of n-graphs are discussed. In particular, n-graphs allow for a characterization of non-repeating Boolean functions (n=2), normal form tables of positional games of n players with complete information, and normal box packings. A Delta-conjecture on n-graphs is formulated. If proved, this conjecture would allow a reduction of n-dimensional normal packings to the two-dimensional case.