Skip to main content
SpringerLink
Log in

Paul Erdös, 1913–1996

Паулъ ЭпдеЩ, 1913–1996

  • Published:
Reliable Computing

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. Erdös, P.Some unsolved problem. Magyar Tud. Akad. Mat. Kut. Int. Közl., 1961, pp. 221–254; partially reprinted in [2], pp. 15–22.

  2. Erdös, P.The art of counting. Selected writings. Spencer, J. (ed.), MIT Press, Cambridge, MA, 1973.

    Google Scholar 

  3. Erdös, P., Goodman, A. W., and Pósa, L.The representation of graphy by set intersection. Canad. Math. J.18 (1966), pp. 106–112; reprinted in [2], pp. 87–93.

    Google Scholar 

  4. Erdös, P. and Hajnal, A.Some remarks on set theory. VIII. Michigan Math. Journal7 (1960), pp. 187–191.

    Google Scholar 

  5. Fishburn, P.Interval orders and interval graphs. Wiley, N.Y., 1985.

    Google Scholar 

  6. Szpilrain-Marczewski, E.Sur duex propietés des classes d'ensembles. Fund. Math.33 (1945), pp. 303–307.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Texas at El Paso, 79968, El Paso, TX, USA

    V. Kreinovich

Authors
  1. V. Kreinovich
    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

Kreinovich, V. Paul Erdös, 1913–1996. Reliable Comput 2, 383–386 (1996). https://doi.org/10.1007/BF02389898

Download citation

  • Issue Date:

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

Keywords

Search

Navigation