University of Birmingham > Talks@bham > Reading Group in Combinatorics and Probability

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

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

Reading Group in Combinatorics and Probability

Add to your list(s) Send you e-mail reminders Further detail
Subscribe using ical/vcal (Help)

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.

Tell a friend about this list:

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 lists

Geometry and Mathematical Physics seminar Cond. Mat. seminar Theoretical Physics Seminars

Other talks

Post-mortem privacy – theory, law and technology FENL: an ISE to mitigate analogue micro-architectural leakage Green's functions: Revenge of the Matsubara Some Physical Applications of Random Matrix Theory - Part 1 Privileged side-channel attacks for enclave adversaries A degree sequence Komlós theorem
 

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