Abstract
The problem of finding a Hamilton decomposition of the complete 3-uniform hypergraph K 3 n has been solved for n ≡ 2(mod 3) and n ≡ 4(mod 6) (Bermond, 1978). We find here a Hamilton decomposition of K 3 n , n ≡ 1(mod 6), and a Hamilton decomposition of the complete 3-uniform hypergraph minus a 1-factor, K 3 n − I, n≡0(mod 3), and thereby complete the problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
