Skip to main content
Springer Nature Link
Log in

A Note on Narushima's Principle of Inclusion–Exclusion on Partition Lattices

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

We restate and reprove Narushima's principle of inclusion–exclusion on partition lattices in terms of abstract tubes. In this way, some new Bonferroni-like inequalities for partition lattices are obtained.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, D-10099 Berlin, Germany. e-mail: dohmen@informatik.hu-berlin.de, , , , , , DE

    Klaus Dohmen

Authors
  1. Klaus Dohmen
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Received: May 20, 1999 Final version received: January 7, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dohmen, K. A Note on Narushima's Principle of Inclusion–Exclusion on Partition Lattices. Graphs Comb 17, 607–610 (2001). https://doi.org/10.1007/PL00007253

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00007253