Lower Bounds for the Probability of a Union via Chordal Graphs
Combinatorics
2025-12-03 v4 Probability
Abstract
We establish new Bonferroni-type lower bounds for the probability of a union of finitely many events where the selection of intersections in the estimates is determined by the clique complex of a chordal graph.
Cite
@article{arxiv.1004.3416,
title = {Lower Bounds for the Probability of a Union via Chordal Graphs},
author = {Klaus Dohmen},
journal= {arXiv preprint arXiv:1004.3416},
year = {2025}
}
Comments
5 pages, 1 figure