Those interested are welcome to attend for all or any part of the event. The two hosting institutions are less than half an hour apart by tube; it is hoped that many people will be able to attend for both days. There is no formal registration process and seats will be allocated each day on a first come, first served basis.
Queries should be sent to Enfale Farooq.
The programme is TBC.
We are running a poster session on Thursday, 9th May 2019, allowing PhD students in Discrete Mathematics and related areas to present their work. A best poster prize will be awarded during the evening reception that day. The jury for this prize will be made up of speakers of the Colloquia.
PhD Students wishing to present a poster should apply by sending an email to Jozef Skokan (J.Skokan@lse.ac.uk) by Friday, 5th April 2019, with a title and abstract for their poster. Notifications for selected posters will be sent out by Friday 12th April 2019.
Some funds are available to contribute to the basic travel expenses of UK-based research students who attend the meetings. We ask you to keep costs to a minimum, using public transportation all occasions and off-peak student travel tariffs wherever possible. Receipts for all journeys must be maintained as proof of travel. At this stage, we are unable to confirm the maximum amount available. Please contact Enfale Farooq (firstname.lastname@example.org) for further information.
Support for this event by the London Mathematical Society and the British Combinatorial Committee is gratefully appreciated by the organisers.
Poster advertising both days of the event is available to download here. Please feel free to electronically distribute this to anyone who might be interested, append to local websites (linking back to this site using the URL tiny.cc/2dayCC) or print out to share on public noticeboards.
2019 sees the thirteenth anniversary of this annual May Colloquium - since 2007, Queen Mary and LSE have held back-to-back one day meetings and details of all past Colloquia can be found as follows: