A third order upper bound is presented on the probability of the union of a finite number of events, by means of graphs called cherry trees. These are graphs that we construct recursively in such a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results