Title：HAMILTON CYCLE DECOMPOSITION OF COMPLETE n-BALANCED r-PARTITE k-UNIFORM HYPERGRAPHS

Abstract：Let r≥k≥2 and Kr,n(k) denote the complete n-balanced r-partite k-uniform hypergraph, whose vertex set consists of r parts, each has n vertices, and whose edge set contains all the k-element subsets with no two vertices from one part. A Hamilton cycle decomposition of Kr,n(k) is a partition of E(Kr,n(k)) into Hamilton cycles. In this talk, I prove that if k≥3, m≥2, n≥1, Kmk(k) has a Hamilton cycle decomposition, then Kmk,n(k) has a Hamilton cycle decomposition.

Speaker：Tai-jiang Jiang, Ph.D., Guizhou University. His research interests include algebra and graph theory.

Date：11:00am-12:00am 2022-6-9 (Thursday).

Tencent Meeting ID：116 934 251

Organizer：School of Mathematical Science

Students and teachers who are interested in graph theory are welcome.