University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Rödl's theorem with restrictions

Rödl's theorem with restrictions

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

If you have a question about this talk, please contact Eoin Long.

It is well known that every uniform d-regular hypergraph with small codegrees contains an almost perfect matching (provided d is large). This result and the proof method have influenced combinatorics substantially. We provide an extension of this theorem where one additional can forbid certain tuples of edges not to appear in the almost perfect matching. This is often very helpful for applications and in particular includes approximate high girth Steiner triple systems. This is joint work with Stefan Glock, Jaehoon Kim, Marcus Kühn and Lyuben Lichev.

This talk is part of the Combinatorics and Probability seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.