University of Cambridge > Talks.cam > Pure Maths Colloquium > Triangle factors in random graphs

Triangle factors in random graphs

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

  • UserOliver Riordan (Oxford)
  • ClockMonday 25 February 2019, 16:00-17:00
  • HouseMR3, CMS.

If you have a question about this talk, please contact HoD Secretary, DPMMS.

The Erdös—Rényi or `binomial’ random graph G(n,p) consists of n vertices, with each pair connected by an edge with probability p, independently of the others. The nature of the model means that `local’ properties (such as individual vertex degrees) tend to be relatively easy to study, whereas `global’ properties (such as the size of the largest component) are much harder. An interesting class of questions relates one to the other. For example, if p=p(n) is chosen so that G(n,p) has whp (`with high probability’, i.e., with probability tending to 1 as n tends to infinity) minimum degree at least 1, does it also have (whp) the global property of connectedness? The answer is yes, as shown already by Erdös and Rényi in 1960. What about minimum degree 2 and containing a Hamilton cycle? Again yes, as shown by Komlós and Szemerédi in 1983. What about every vertex being in a triangle, and the graph containing a triangle factor, i.e., a set of n/3 disjoint triangles covering all the vertices? This question turned out to be much harder, and was eventually answered (approximately) by Johansson, Kahn and Vu in 2008.

In this talk I will describe at least some aspects of the proof of the last result, as well as a related recent development. The aim is not so much to present particular results, but rather to give a flavour of the range of methods that are used in studying this type of problem.

The colloquium is followed by a wine reception in Central Core.

This talk is part of the Pure Maths Colloquium series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity