The edge correlation of random forests
|
Tue, 17/02/2009 14:30 |
Dudley Stark (QMUL) |
Combinatorial Theory Seminar  |
L3 |
| The conjecture was made by Pemantle that a forest chosen uniformly at random from all forests in any finite graph G has the edge-negative association property. We use enumerative methods to show that this conjecture is true for n large enough when G is a complete graph on n vertices and derive related results for random trees. | |||