An improvement of the inclusion-exclusion principle

Archiv der Mathematik

Volumn 72, Issue 4, 1999, Pages 298-303

  Dohmen, Klaus ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033468334     PISSN: 0003889X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s000130050336     Document Type: Article

References (13)

1. G. D. BIRKHOFF, A determinant formula for the number of ways of coloring a map. Ann. Math. 14, 42-46 (1912).
2. K. DOHMEN, Inclusion-exclusion and network reliability. Electron. J. Combin. 5, paper no. 36 (1998).
3. K. DOHMEN, A note on Möbius inversion over power set lattices. Commentat. Math. Univ. Carol. 38, 121-124 (1997).
4. K. DOHMEN, A broken-circuits-theorem for hypergraphs. Arch. Math. 64, 159-162 (1995).
5. A. HERON, Matroid polynomials. Southend-on-Sea: The Institute of Mathematics and its Applications X, 164-202 (1972).
6. H. NARUSHIMA, Principle of inclusion-exclusion on partially ordered set. Discrete Math. 42, 243- 250 (1982).
7. H. NARUSHIMA, Principle of inclusion-exclusion on semilattices. J. Combinat. Theory Ser. A 17, 196-203 (1974).
8. H. NARUSHIMA and H. ERA, A variant of inclusion-exclusion on semilattices. Discrete Math. 21, 215-217 (1978).
9. J. RIORDAN, An introduction to combinatorial analysis. New York 1958.
10. G. C. ROTA, On the foundations of combinatorial theory I. Theory of Möbius functions. Z. Wahrscheinlichkeitstheorie Verw. Geb. 2, 340-368 (1964).
11. E. SZPILRAJN, Sur l'extension de l'ordre partiel. Fundam. Math. 16, 386-389 (1930).
12. A. TUCKER, Applied combinatorics. Chichester 1995.
13. H. WHITNEY, A logical expansion in mathematics. Bull. Amer. Math. Soc. 38, 572-579 (1932).