Hypergraphs and sharpened sieve inequalities
From MaRDI portal
Publication:1336651
DOI10.1016/0012-365X(92)00561-5zbMath0809.05074MaRDI QIDQ1336651
Publication date: 28 November 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
hypergraphBonferroni inequalitiesmeasure spacehypertreesfinitely generated Boolean algebrassieve inequalities
Combinatorial identities, bijective combinatorics (05A19) Hypergraphs (05C65) Combinatorial probability (60C05) Combinatorial inequalities (05A20)
Cites Work
- Quelques remarques sur les probabilités des événements dépendants
- Hypertrees and Bonferroni inequalities
- Sharpened Bonferroni inequalities
- Sharp Bounds on Probabilities Using Linear Programming
- Bonferroni-Type Inequalities Via Interpolating Polynomials
- Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur
- Inequalities for the probability of the occurrence of at least m out of n events
- An upper bound for the probability of a union
- On the Probability of the Occurrence of at Least $m$ Events Among $n$ Arbitrary Events
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hypergraphs and sharpened sieve inequalities