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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Monochromatic tight cycle partition for 3-graphs

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Trinity College Chapel, Trinity Street Senior Parlour, Gonville & Caius College Russian icons: a sacred tradition which inspired modernism by Natalia Budanova

Other talks

Morning Tea and Coffee Title to be confirmed CSAR lecture: 46&: Development of a probiotic that supports the natural removal of forever chemicals from the body Morning Break Precision psychiatry External Seminar - Hilde Nelissen TBC
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity