报告题目：HAMILTON CYCLE DECOMPOSITION OF COMPLETE n-BALANCED r-PARTITE k-UNIFORM HYPERGRAPHS

报告简介：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.

报告人：蒋太江，贵州大学博士，主要从事代数与图论研究。

报告时间：2022年6月9日（星期四）上午 11:00-12:00

报告地点：腾讯会议，ID：116 934 251

主办单位：扬州大学数学科学学院、扬州大学科技处

欢迎广大师生参加！