University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Rigid combinatorial objects

Rigid combinatorial objects

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

If you have a question about this talk, please contact Dr Andrew Treglown.

Random models of many combinatorial objects are difficult to analyse because their components exhibit dependence between each other (although, morally, only to a very small extent). Examples include random regular graphs (the event that two vertices are adjacent affects all other adjacencies), random Latin squares (the presence of a certain small substructure influences all other entries), random designs and decompositions. I will present a method that overcomes these difficulties and give a very short and simple proof to a longstanding open problem.

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.