See the preview in Zbl 0577.05052.
Cites work
- An improved Bonferroni inequality and applications
- An upper bound for the probability of a union
- scientific article; zbMATH DE number 3026527 (Why is no real title available?)
- Methods for Proving Bonferroni Type Inequalities
- Tests of the Kolmogorov-Smirnov type for exponential data with unknown scale, and related problems
Cited in
(14)- Two packing problems on \(k\)-matroid trees
- Ordered \(h\)-hypertrees
- Minimum spanning hypertrees
- Hypergraphs and sharpened sieve inequalities
- Complexity of some graph-based bounds on the probability of a union of events
- A contribution to the chromatic theory of uniform hypergraphs
- Computing bounds for the probability of the union of events by different methods
- Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints
- Improved Bonferroni Inequalities and Binomially Bounded Functions
- Probability bounds given by hypercherry trees
- Polynomially computable bounds for the probability of the union of events
- A randomized method for handling a difficult function in a convex optimization problem, motivated by probabilistic programming
- Subset complement addition upper bounds. An improved inclusion-exclusion method
- Bonferroni-type inequalities and binomially bounded functions
This page was built for publication: Hypertrees and Bonferroni inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1077437)
