Skip to main content
SpringerLink
Log in

The Maturation of the Probabilistic Method

  • Chapter
Building Bridges

Part of the book series: Bolyai Society Mathematical Studies ((BSMS,volume 19))

  • 1211 Accesses

Abstract

In this historical review we discuss probability results of László Lovász and Svante Janson. These results have, we feel, played a central role in the development of the Probabilistic Method.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • 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.

References

  1. N. Alon and J. Spencer, The Probabilistic Method, 3rd ed., John Wiley, 2008.

    Google Scholar 

  2. R. Boppana and J. Spencer, A Useful Elementary Correlation Inequality, J. Comb. Th. — Ser. A, 50 (1989), 305–307.

    Article  MathSciNet  Google Scholar 

  3. P. Erdős and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, in: Infinite and Finite Sets (A. Hajnal et al., eds.), North-Holland (1975), pp. 609–628.

    Google Scholar 

  4. P. Erdős, Some remarks on the theory of graphs, Bull. Amer. Math. Soc., 53 (1947), 292–294.

    Article  MathSciNet  Google Scholar 

  5. P. Erdős and A. Rényi, On the evolution of random graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl., 5 (1960), 17–61.

    Google Scholar 

  6. S. Janson, T. Luczak and A. Ruciński, An exponential bound for the probability of nonexistence of a specified subgraph in a random graph, in: Random graphs’ 87 (Poznań, 1987), Wiley (1990), pp. 73–87.

    Google Scholar 

  7. J. Spencer, Ramsey’s Theorem — A new lower bound, J. Comb. Th. — Ser. A, 18 (1975), 108–115.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Courant Institute of Mathematical Sciences, New York, USA

    Joel Spencer

Authors
  1. Joel Spencer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB), Takustr. 7, 14195, Berlin, Germany

    Martin Grötschel

  2. Hungarian Academy of Sciences, Alfréd Rényi Institute of Mathematics, Reáltanoda u. 13-15, Budapest, 1053, Hungary

    Gyula O. H. Katona  & Gábor Sági  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2008 János Bolyai Mathematical Society and Springer-Verlag

About this chapter

Cite this chapter

Spencer, J. (2008). The Maturation of the Probabilistic Method. In: Grötschel, M., Katona, G.O.H., Sági, G. (eds) Building Bridges. Bolyai Society Mathematical Studies, vol 19. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85221-6_18

Download citation

Publish with us

Policies and ethics

Search

Navigation