Skip to main content
SpringerLink
Log in

Die Probabilistische Methode

  • Chapter
  • First Online:
Das BUCH der Beweise

  • 8874 Accesses

Zusammenfassung

Wir haben dieses Buch mit den ersten Aufsätzen von Paul Erd˝os in der Zahlentheorie begonnen. Wir schließen es nun mit dem Beitrag zur Mathematik, der wohl sein größtes Vermächtnis bleiben wird — der Probabilistischen Methode, die er gemeinsam mit Alfred Rényi entwickelt hat.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 59.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  • [1] M. AJTAI, V. CHVÁTAL, M. NEWBORN & E. SZEMERÉDI: Crossing-free subgraphs, Annals of Discrete Math. 12 (1982), 9-12.

    Google Scholar 

  • [2] N. ALON & J. SPENCER: The Probabilistic Method, Third edition, Wiley-Interscience 2008.

    Google Scholar 

  • [3] D. CONLON: A new upper bound for diagonal Ramsey numbers, AnnalsMath. 170 (2009), 941–960.

    Google Scholar 

  • [4] P. ERDŐS: Some remarks on the theory of graphs, Bulletin Amer. Math. Soc. 53 (1947), 292-294.

    Google Scholar 

  • [5] P. ERDŐS: Graph theory and probability, Canadian J. Math. 11 (1959), 34-38.

    Google Scholar 

  • [6] P. ERDŐS: On a combinatorial problem I, Nordisk Math. Tidskrift 11 (1963), 5-10.

    Google Scholar 

  • [7] P. ERDŐS & R. K. GUY: Crossing number problems, Amer. Math. Monthly 80 (1973), 52-58.

    Google Scholar 

  • [8] P. ERDŐS & A. RÉNYI: On the evolution of random graphs, Magyar Tud. Akad. Mat. Kut. Int. Közl. 5 (1960), 17-61.

    Google Scholar 

  • [9] T. LEIGHTON: Complexity Issues in VLSI, MIT Press, Cambridge MA 1983.

    Google Scholar 

  • [10] J. RADHAKRISHNAN & A. SRINIVASAN: Improved bounds and algorithms for hypergraph 2-coloring, Random Struct. Algorithms 16 (2000), 4–32.

    Google Scholar 

  • [11] L. A. SZÉKELY: Crossing numbers and hard Erdős problems in discrete geometry, Combinatorics, Probability, and Computing 6 (1997), 353-358.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik, Freie Universität Berlin, Berlin, Deutschland

    Martin Aigner & Günter M. Ziegler

Authors
  1. Martin Aigner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Günter M. Ziegler
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Martin Aigner .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer-Verlag GmbH Deutschland, ein Teil von Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Aigner, M., Ziegler, G.M. (2018). Die Probabilistische Methode. In: Das BUCH der Beweise. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-57767-7_45

Download citation

Publish with us

Policies and ethics

Search

Navigation