Skip to main content
Springer Nature Link
Log in

Frankl's Conjecture Is True for Lower Semimodular Lattices

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

It is shown that every finite lower semimodular lattice L with |L|≥2 contains a join-irreducible element x such that at most |L|/2 elements y∈L satisfy y≥x.

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. Universität Hannover, Institut für Mathematik, Welfengarten 1, 30167 Hannover, Germany. e-mail: reinhold@math.uni-hannover.de, , , , , , DE

    Jürgen Reinhold

Authors
  1. Jürgen Reinhold
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Revised: August 16, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Reinhold, J. Frankl's Conjecture Is True for Lower Semimodular Lattices. Graphs Comb 16, 115–116 (2000). https://doi.org/10.1007/s003730050008

Download citation

  • Issue Date:

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

Keywords