Thursday, January 31, 2019

[DMANET] Winter Combinatorics Meeting, 20th February, Open University, UK

The 18th Winter Combinatorics Meeting will take place on Wednesday
20th February 2019.
Location: CMR room 15, The Open University, Milton Keynes, UK

All are welcome -- this event is free, but to assist with catering we
ask those wishing to attend to sign-up by the morning of Monday 11th
February by completing this short form:
https://docs.google.com/forms/d/e/1FAIpQLSfoZDWNQf4mYlIf8ukCqLMGoagVsGS1JpPxBxUH_b_8dViTOQ/viewform

Full details (including travel advice):
http://www.mathematics.open.ac.uk/seminars-and-events/winter-combinatorics-meeting

This year, we are celebrating early-career researchers, with 7 of the
8 talks being given by PhD students or postdoctoral researchers. The
provisional schedule is as follows:

10:00 - 10:30 Natalie Behague, Queen Mary, University of London:
Semi-perfect 1-factorizations of the hypercube
10:30 - 11:00 Alberto Espuny Díaz, University of Birmingham: Edge
correlations in random regular hypergraphs

11:00 - 11:30 Tea/Coffee

11:30 - 12:30 Keynote speaker: Mathilde Bouvel (Zürich)

12:30 - 14:00 Lunch

14:00 - 14:30 Fiona Skerman, Uppsala Universitet: Random tree
recursions: which fixed points correspond to tangible sets of trees?
14:30 - 15:00 John Haslegrave, University of Warwick: Spanning
surfaces in 3-uniform hypergraphs
15:00 - 15:30 Matthew Coulson, University of Birmingham: A rainbow
Dirac's theorem

15:30 - 16:00 Tea/Coffee

15:30 - 16:30 Rachel Kirsch, London School of Economics: Many cliques
with few edges
16:30 - 17:00 David Marchant, The Open University: The growth of the
Möbius function on the permutation poset

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************