| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650322 | Discrete Mathematics | 2008 | 6 Pages |
Abstract
The bound known as Hunter’s bound states that P(A1∪⋯∪An)≤∑i=1npi−∑{i,j}∈Tpi,j, where TT designates the heaviest spanning tree of the graph on nn nodes with edge weights pi,jpi,j. We prove that Hunter’s bound is optimal if and only if the input probabilities are given on a tree.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Pierangela Veneziani,