Seminar series
Date
Tue, 17 Feb 2009
Time
14:30 -
15:30
Location
L3
Speaker
Dudley Stark
Organisation
QMUL
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.