Monochromatic tight cycle partition for 3-graphs

Add to your list(s) Download to your calendar using vCal

• Allan Lo (University of Birmingham)
• Thursday 16 May 2019, 14:30-15:30
• MR12.

If you have a question about this talk, please contact Andrew Thomason.

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.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.