University of Cambridge > > Combinatorics Seminar > Monochromatic tight cycle partition for 3-graphs

Monochromatic tight cycle partition for 3-graphs

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

  • UserAllan Lo (University of Birmingham)
  • ClockThursday 16 May 2019, 14:30-15:30
  • HouseMR12.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity