Combinatorial Theory Seminar
|
Tue, 18/01/2011 14:30 |
Christopher Dowden |
Combinatorial Theory Seminar |
L3 |
|
Tue, 08/02/2011 16:30 |
Lutz Warnke |
Combinatorial Theory Seminar |
SR2 |
The -free process starts with the empty graph on vertices and adds edges chosen uniformly at random, one at a time, subject to the condition that no copy of is created. For every we show that, with high probability as , the maximum degree is , which confirms a conjecture of Bohman and Keevash and improves on bounds of Osthus and Taraz. Combined with previous results this implies that the -free process typically terminates with edges, which answers a question of Erd\H{o}s, Suen and Winkler. This is the first result that determines the final number of edges of the more general -free process for a non-trivial class of graphs . We also verify a conjecture of Osthus and Taraz concerning the average degree, and obtain a new lower bound on the independence number. Our proof combines the differential equation method with a tool that might be of independent interest: we establish a rigorous way to `transfer' certain decreasing properties from the binomial random graph to the -free process. |
|||
|
Tue, 22/02/2011 14:30 |
James King (Oxford) |
Combinatorial Theory Seminar |
L3 |
|
Tue, 08/03/2011 14:30 |
Dominic Welsh (Oxford) |
Combinatorial Theory Seminar |
L3 |
| I shall describe some recent results about the asymptotic behaviour of matroids. Specifically almost all matroids are simple and have probability at least 1/2 of being connected. Also, various quantitative results about rank, number of bases and number and size of circuits of almost all matroids are given. There are many open problems and I shall not assume any previous knowledge of matroids. This is joint work, see below. 1 D. Mayhew, M. Newman, D. Welsh and G. Whittle, On the asymptotic properties of connected matroids, European J. Combin. to appear 2 J. Oxley, C. Semple, L. Wasrshauer and D. Welsh, On properties of almost all matroids, (2011) submitted | |||

-free process starts with the empty graph on
vertices and adds edges chosen uniformly at random, one at a time, subject to the condition that no copy of
we show that, with high probability as
, the maximum degree is
, which confirms a conjecture of Bohman and Keevash and improves on bounds of Osthus and Taraz. Combined with previous results this implies that the
edges, which answers a question of Erd\H{o}s, Suen and Winkler. This is the first result that determines the final number of edges of the more general
-free process for a non-trivial class of graphs