Bonferroni-Type Inequalities
via Chordal Graphs
2002 ◽
Vol 11
(4)
◽
pp. 349-351
◽
Let {Av}v∈V be a finite collection of events and G = (V, E) be a chordal graph. Our main result – the chordal graph sieve – is a Bonferroni-type inequality where the selection of intersections in the estimates is determined by a chordal graph G. It interpolates between Boole's inequality (G empty) and the sieve formula (G complete). By varying G, several inequalities both well-known and new are obtained in a concise and unified way.
1993 ◽
Vol 2
(4)
◽
pp. 409-415
◽
2009 ◽
Vol DMTCS Proceedings vol. AK,...
(Proceedings)
◽
Keyword(s):
2018 ◽
Vol 86
(5)
◽
pp. 1867-1900
◽
Keyword(s):
Keyword(s):
2021 ◽
Vol 41
(3)
◽
pp. 710-735