The edge correlation of random forests

17 February 2009
Dudley Stark
<span hover_container="show_item_16573203" id="content_item_16573203" class="content hover_target"><span hover_container="show_item_16573203" class="commentable_icon_position_reference"> <p hover_container="show_item_16573203"> 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. </p> </span></span>
  • Combinatorial Theory Seminar