New Combinatorics Study Findings Have Been Reported fromWarsaw University of Technology

摘要

"Let H be a k-uniform hypergraph, k>= 2. By an Euler tour in H we mean an alternating sequence v(0),ne(1), v(1), e(2), v(2), ..., v(m-1), e(m), v(m) = v(0) of vertices and edges in H such that each edge of Hnappears in this sequence exactly once and v(i-1), v(i) is an element of e(i), v(i-1) not equal v(i), for every in= 1,2,...,m. This is an obvious generalization of the graph theoretic concept of an Euler tour,"ninvestigators in Warsaw, Poland report.