Supported by the National Natural Science Foundation of China(Grant No.11161032)
The problem of decomposing a complete 3-uniform hypergraph into Hamilton cycles was introduced by Bailey and Stevens using a generalization of Hamiltonian chain to uniform hypergraphs by Katona and Kierstead. Decompos...
Supported by NRF South Africa;the National Natural Science Foundation of China(Grant No.11161032)
It is proved in this paper that if G is a simple connected r-uniform hypergraph with ||G||≥2, then G has an edge e such that G - e - V1(e) is also a simple connected r-uniform hypergraph. This reduction is natu...