Improved inclusion-exclusion identities and inequalities based on a particular class of abstract tubes

Electronic Journal of Probability

Volumn 4, Issue , 1999, Pages 1-12

  Dohmen, Klaus ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Abstract simplicial complex; Abstract tube; Bonferroni inequalities; Broken circuit complex; Chain; Chromatic polynomial; Dynamic programming; Graph coloring; Inclusion exclusion; Network reliability; Partial order; Sieve formula

Indexed keywords

EID: 0003228094     PISSN: None     EISSN: 10836489     Source Type: Journal    
DOI: 10.1214/EJP.v4-42     Document Type: Article

References (17)

1. G. D. BIRKHOFF, A determinant formula for the number of ways of coloring a map, Ann. Math. 14 (1912), 42-46.
2. C. E. Bonferroni, Teoria statistica delle classi e calcolo delle probabilita, Pubblicazioni del R. Istituto Superiore di Scienze Economiche e Commerciali di Firenze 8 (1936), 1-62.
3. K. Dohmen, Inclusion-exclusion and network reliability, Electron. J. Combin. 5 (1998), paper no. 36. [Internet: http://www.combinatorics.org]
4. K. Dohmen, Improved Bonferroni inequalities for the reliability of a communication network, Preprint, Informatik-Bericht Nr. 114, Humboldt-Uni-versitat zu Berlin, 1998.
5. K. Dohmen, Lower bounds and upper bounds for chromatic polynomials, J. Graph Theory 17 (1993), 75-80.
6. K. Dohmen, On partial sums of chromatic polynomials, Ars Combin., accepted for publication.
7. J. Galambos and I. Simonelli, Bonferroni-type Inequalities with Applications, Springer-Verlag, New York, 1996.
8. R.M. Karp, Dynamic programming meets the principle of inclusionexclusion, Oper. Res. Lett. 1 (1982), 49-51.
9. T.A. McKee, Graph structure for inclusion-exclusion inequalities, Congr. Numer. 125 (1997), 5-10.
10. D. Q. Naiman and H.P. Wynn, Abstract tubes, improved inclusionexclusion identities and inequalities and importance sampling, Ann. Statist. 25 (1997), 1954-1983.
11. H. Narushima, Principle of inclusion-exclusion on partially ordered sets, Discrete Math. 42 (1982), 243-250.
12. J.S. Provan and M.O. Ball, Computing network reliability in time polynomial in the number of cuts, Oper. Res. 32 (1984), 516-526.
13. D.R. Shier, Network Reliability and Algebraic Structures, Clarendon Press, Oxford, 1991.
14. L. Takacs, On the method of inclusion and exclusion, J. Amer. Stat. 62 (1967), 102-113.
15. I. Tomescu, Hypertrees and Bonferroni inequalities, J. Combin. Theory Ser. B 41 (1986), 209-217.
16. H. Whitney, A logical expansion in mathematics, Bull. Amer. Math. Soc. 38 (1932), 572-579.
17. H. Wilf, Which polynomials are chromatic? Proc. Colloq. Combinatorial Theory, Rome, 1973.