题目：Monochromatic tight cycle partition for $3$-graphs

报告人：Allan Lo（School of Mathematics,University of Birmingham)

时间：4月9日（周二）上午10: 30-11：30

地点：二教2204

Abstract: A conjecture of Lehel states that every $2$-edge-coloured complete graph can be partitioned into two disjoint monochromatic cycles. This conjecture was confirmed by Bessy and Thomass\'e. We prove that its analogous result holds for tight cycles in $3$-uniform hypergraph, that is, every $2$-edge-coloured (large) complete $3$-uniform hypergraph can be partitioned into two monochromatic tight cycles.

This is joint work with Frederik Garbe, Richard Lang, Richard Mycroft and Nicol\'{a}s Sanhueza-Matamala.     

欢迎感兴趣的师生参加！