Skip to main content
SpringerLink
Log in

The maximal size of the covering graph of a lattice

  • Published:
algebra universalis Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. S. Hart,A note on the edges of the n-cube, Discr. Math.14 (1976), 157–163.

    Article  MATH  MathSciNet  Google Scholar 

  2. M. N. Huxley,On the difference between consecutive primes, Invent. Math.15 (1972), 164–170.

    Article  MATH  MathSciNet  Google Scholar 

  3. P. Turán,On the theory of graphs, Coll. Math.3 (1954), 19–30.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Calgary, Calgary, Alberta, Canada

    Béla Bollobás & Ivan Rival

Authors
  1. Béla Bollobás
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ivan Rival
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bollobás, B., Rival, I. The maximal size of the covering graph of a lattice. Algebra Universalis 9, 371–373 (1979). https://doi.org/10.1007/BF02488048

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation