![]() |
![]() |
Reading Group in Combinatorics and Probability
Add to your list(s)
Send you e-mail reminders
Further detail
In Spring 2019 we will be covering selected topics from `The Probabilisitic Method’, by Alon and Spencer. We will meeting on Mondays at 4pm in Lecture Theatre C. We will cover the following topics: Dependent Random Choice, Janson’s inequality, Clique number of random graphs, Chromatic number of random graphs, Rödl Nibble, Independence number of triangle-free graphs, Quasirandom graphs, Containers and list colouring. 0 upcoming talks and 39 talks in the archive. If you have a question about this list, please contact: Guillem Perarnau; n.fountoulakis; Henning Sulzbach; Felix Joos; Stefan Glock; R.H.Montgomery. If you have a question about a specific talk, click on that talk to find its organiser. |
Other listsArtificial Intelligence and Natural Computation seminars Cold Atoms Computer Science Distinguished SeminarsOther talksElectron Phonon Decoupling in Disordered Graphene Seminar: TBA Well Founded Coalgebras Colloquium: TBA Modelling uncertainty in image analysis. Seminar: TBA |