Skip to main content
SpringerLink
Log in

The erdős graph and the beast

  • Article
  • Published:
The Mathematical Intelligencer Aims and scope Submit manuscript

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. De Castro, R., & Grossman, J., Famous trails to Paul Erdős,Mathematical Intelligencer 21 (1999), no. 3, 51–63.

    Article  MATH  MathSciNet  Google Scholar 

  2. Erdős, P., On the fundamental problem of mathematics,American Mathematical Monthly 79 (1972), 149–150.

    Article  MathSciNet  Google Scholar 

  3. Eves, H.,An Introduction to the History of Mathematics. Hoit, Rinehart & Winston, New York, 1967.

    Google Scholar 

  4. Goffman, C, And what is your Erdős number?American Mathematical Monthly 76 (1969), 791.

    Article  MATH  MathSciNet  Google Scholar 

  5. Vitanyi, P.M.B., How well can a graph be n-colored?Discreta Mathematics 34 (1981), 69–80.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI Kruislaan 413, 1098SJ, Amsterdam, The Netherlands

    Paul M. B. Vitanyi

Authors
  1. Paul M. B. Vitanyi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paul M. B. Vitanyi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vitanyi, P.M.B. The erdős graph and the beast. The Mathematical Intelligencer 21, 54–63 (1999). https://doi.org/10.1007/BF03025417

Download citation

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation