Skip to main content
SpringerLink
Log in

The Probabilistic Method

  • Chapter
Probabilistic Methods for Algorithmic Discrete Mathematics

Part of the book series: Algorithms and Combinatorics ((AC,volume 16))

Abstract

Erdös is usually credited as being the pioneer of the probabilistic method, beginning with his seminal 1947 paper [21], although the probabilistic method had been used in at least two previous occasions by Turán in 1934[66] and by Szele in 1943[63]. By now, it is widely recognized as one of the most important techniques in the field of combinatorics. In this short survey, we will introduce a few of the basic tools and describe some of the areas in which the method has had impact.

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 84.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. Ajtai M., Komlós J. and Szemerédi E. (1980): A note on Ramsey numbers, J. Comb. Th. A 29, 354–360.

    Google Scholar 

  2. Ajtai M., Komlós J. and Szemerédi E. (1981): A dense infinite Sidon sequence, Eur. J. Comb. 2, 1–11.

    MATH  Google Scholar 

  3. Alon N. (1996): Disjoint directed cycles. J. Comb. Th. (B) 68, 167–178.

    Article  MATH  Google Scholar 

  4. Alon N. (1996): Independence numbers of locally sparse graphs and a Ramsey type problem, Rand. Struct. Alg. 9, 271–278.

    Article  MATH  Google Scholar 

  5. Alon N. (1992): The strong chromatic number of a graph. Random Structures and Algorithms, 3, 1–7.

    Article  MathSciNet  MATH  Google Scholar 

  6. Alon N. (1991): A parallel algorithmic version of the Local Lemma, Random Structures and Algorithms, 2, 367–378.

    Article  MathSciNet  MATH  Google Scholar 

  7. Alon N. (1988): The linear arboricity of graphs. Isr. J. Math., 62, 311–325.

    Article  MATH  Google Scholar 

  8. Alon N., Krivelevich M. and Sudakov B. (1998): List colouring of random and pseudo-random graphs, preprint.

    Google Scholar 

  9. Alon N. and Linial N. (1989): Cycles of length 0 modulo k in directed graphs. J. Comb. Th. (B) 47, 114–119.

    Article  MathSciNet  MATH  Google Scholar 

  10. Alon N., McDiarmid C. and Molloy M. (1996): Edge-disjoint cycles in regular directed graphs, J. Graph Th. 22, 231–237.

    Article  MathSciNet  MATH  Google Scholar 

  11. Alon N. and Spencer J. (1992): The Probabilistic Method. Wiley.

    Google Scholar 

  12. Azuma K. (1967): Weighted sums of certain dependent random variables, Tokuku Math. Journal 19, 357–367.

    MathSciNet  MATH  Google Scholar 

  13. Beck J. (1991): An algorithmic approach to the Lovész Local Lemma, Random Structures and Algorithms, 2, 343–365.

    Article  MathSciNet  MATH  Google Scholar 

  14. Bermond J. and Thomassen C. (1981): Cycles in digraphs–a survey. J. Graph Th. 5, 1–43.

    Article  MathSciNet  MATH  Google Scholar 

  15. Behzad M. (1965): Graphs and Their Chromatic Numbers, Ph.D. thesis, Michigan State University.

    Google Scholar 

  16. Beutelspacher A. and Hering P. (1984)• Minimal graphs for which the chromatic number equals the maximal degree, Ars Combinatorica 18 201–216.

    Google Scholar 

  17. Bollobâs B. (1985): Random Graphs, Academic Press, London.

    MATH  Google Scholar 

  18. Bollobés B. and Harris A. (1985): List-colourings of graphs, Graphs and Comb. 1, 115–127.

    Article  Google Scholar 

  19. Borodin O. and Kostochka A. (1997): On an upper bound on a graph’s chromatic number, depending on the graphs’s degree and density J.C.T.(B) 23, 247–250.

    MathSciNet  Google Scholar 

  20. Broder A.Z., Frieze A. and Upfal E. (1997): Static and dynamic path selection on expander graphs: a random walk approach, STOC.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  22. Erdös P. (1959): Graph theory and probability, Canadian J. of Math. 11, 34–38.

    Article  MATH  Google Scholar 

  23. Erdös P. (1961): Graph theory and probability II, Canadian J. of Math. 13, 346–352.

    Article  MATH  Google Scholar 

  24. Erdös P. and Lovâsz L. (1975): Problems and results on 3-chromatic hyper-graphs and some related questions, in: “Infinite and Finite Sets” (A. Hajnal et. al. Eds), Colloq. Math. Soc. J. Bolyai 11, North Holland, Amsterdam, 609–627.

    Google Scholar 

  25. Erdös P., Rubin A. and Taylor H. (1979): Choosability in graphs, Congr. Num. 26, 125–157.

    Google Scholar 

  26. Erdös P. and Selfridge J. (1973): On a combinatorial game, J. Comb. Th. (A) 14, 298–301.

    Article  MATH  Google Scholar 

  27. Erdös P., Suen S. and Winkler P. (1995): On the size of a random maximal subgraph, Random Structures and Algorithms 6, 309–318.

    Article  MathSciNet  MATH  Google Scholar 

  28. Fernandez de la Véga W. (1983): On the maximum cardinality of a consistent set of arcs in a random tournament, J. Comb. Th. (B) 35, 328–332.

    Article  MATH  Google Scholar 

  29. Frieze A. (1991): On the length of the longest monotone increasing subsequence in a random permutation, Ann. Appl. Prob. 1, 301–305.

    Article  MathSciNet  MATH  Google Scholar 

  30. Frieze A. and Molloy M. (1998): Splitting expander graphs, in preparation.

    Google Scholar 

  31. Häggkvist R. and Janssen J. (1997): New bounds on the list chromatic index of the complete graph and other simple graphs, Combin., Prob. and Comp. 6, 273–295.

    Article  Google Scholar 

  32. Hind H., Molloy M. and Reed B. (1998): Colouring a graph frugally, Combinatorica, to appear.

    Google Scholar 

  33. Hind H., Molloy M. and Reed B. (1998): Total colouring with d+poly(logd) colours, SIAM J. of Computing, to appear.

    Google Scholar 

  34. Heoffding W.J. (1963): Probability inequalities for sums of bounded random variables, J. amer. Statist. Assoc., 58, 713–721.

    Article  MathSciNet  Google Scholar 

  35. Jensen T. and Toft B. (1995): Graph colouring problems, Wiley New York.

    Google Scholar 

  36. Johansson A. (1996): Asymptotic choice number for triangle free graphs, DIMACS Technical Report 91–5.

    Google Scholar 

  37. Johansson A. (1998): The choice number of sparse graphs, manuscript.

    Google Scholar 

  38. Kahn J. (1996): Asymptotically good list-colorings, J. Combinatorial Th. (A), 73, 1–59.

    Article  MathSciNet  MATH  Google Scholar 

  39. Kahn J. (1996): Asymptotics of the chromatic index for multigraphs, J. Combinatorial Th. (B), 68, 233–255.

    Article  MathSciNet  MATH  Google Scholar 

  40. Kahn J. (1998): Asymptotics of the list-chromatic index for multigraphs, manuscript.

    Google Scholar 

  41. Kim J.H. (1995): On Brooks’ Theorem for sparse graphs, Combinatorics, Probability and Computing 4, 97–132.

    Article  MATH  Google Scholar 

  42. Kim J.H. (1995): The Ramsey number R(3, t) has order of magnitude t2/ log t., Random Structures and Algorithms 7, 173–207.

    Article  MathSciNet  MATH  Google Scholar 

  43. Krivelevich M. (1995): Bounding Ramsey numbers through large deviation inequalities, Random Struct. and Alg. 7, 145–155.

    Article  MathSciNet  MATH  Google Scholar 

  44. Lawrence J. (1978): Covering the vertex set of a graph with subgraphs of smaller degree, Disc. Math 21, 61–68.

    MathSciNet  MATH  Google Scholar 

  45. Lagan B. and Shepp L. (1977): A variational problem for Young tableaux, Adv. Math. 26, 206–222.

    Google Scholar 

  46. Lovâsz L. (1968): On chromatic number of finite set-systems, Acta Math. Acad. Sci. Hung. 19, 59–67.

    Article  MATH  Google Scholar 

  47. McDiarmid C. (1989): On the method of bounded differences. Surveys in Combinatorics, Proceedings of the Twelfth British Combinatorial Conference, 148–188.

    Google Scholar 

  48. Molloy M. and Reed B. (1997): A bound on the strong chromatic index of a graph, J. of Comb. Th. (B) 69, 103–109.

    Article  MathSciNet  MATH  Google Scholar 

  49. Molloy M. and Reed B. (1998): A bound on the total chromatic number, Combinatorica, to appear.

    Google Scholar 

  50. Molloy M. and Reed R. (1998): Asymptotically better list colourings, manuscript.

    Google Scholar 

  51. Molloy M. and Reed B. (1998): Further algorithmic aspects of the Local Lemma, to appear in the proccedings of the 30th ACM Symposium on Theory of Computing.

    Google Scholar 

  52. Molloy M. and Reed B. (1998): Graph Colouring via the Probabilistic Method, preprint.

    Google Scholar 

  53. Molloy M. and Reed B.: Graph Colouring with the Probabilistic Method, a book in preperation.

    Google Scholar 

  54. Nesetril J. and Rödl V. (1979): A short proof of the existence of highly chromatic hypergraphs without short cycles, J. Comb. Th. (B) 27, 225–227.

    Article  MATH  Google Scholar 

  55. Pippenger N. and Spencer J. (1989): Asymptotic behavior of the chromatic index for hypergraphs, J. Combinatorial Th. (A) 51, 24–42.

    Article  MathSciNet  MATH  Google Scholar 

  56. Reed B. (1997): X, 4 and w, Journal of Graph Theory, to appear.

    Google Scholar 

  57. Reed B. (1998): A strenghtening of Brooks’ Theorem, manuscript.

    Google Scholar 

  58. Rödl V. (1985): On a packing and covering problem, Europ. J. Combinatorics 5, 69–78.

    Google Scholar 

  59. Shearer J. (1983): A note on the independence number of triangle-free graphs, Disc. Math. 46, 83–87.

    MathSciNet  MATH  Google Scholar 

  60. Shearer J. (1995): On the independence number of sparse graphs, Rand. Struc. Alg. 7, 269–271.

    Article  MathSciNet  MATH  Google Scholar 

  61. Spencer J. (1977): Asymptotic lower bounds for Ramsey functions, Disc. Math. 20, 69–76.

    Google Scholar 

  62. Spencer J. (1994): Maximal triangle-free graphs and the Ramsey number R(3, k), manuscript.

    Google Scholar 

  63. Szele T. (1943): Kombinatorikai vizsgâlatok az irânyitott teljes gr’affal kapcsolatban, Mat. Fiz. Lapok 50, 233–256.

    MathSciNet  Google Scholar 

  64. Talagrand M. (1995): Concentration of measure and isoperimetric inequalities in product spaces. Institut Des Hautes Études Scientifiques, Publications Mathématiques 81, 73–205.

    Article  MathSciNet  MATH  Google Scholar 

  65. Thomassen C. (1983): Disjoint cycles in digraphs, Combinatorica 3, 393–396.

    Article  MathSciNet  MATH  Google Scholar 

  66. Turân P. (1934): On a theorem of Hardy and Ramanujan, J. London Math Soc. 9, 274–276.

    Article  Google Scholar 

  67. Versik A. and Kerov C. (1977): Asymptotics for the Plancherai measure of the symmetric group and a limiting form for Young tableaux, Dokl. Akad. Nauk USSR 233, 1024–1027.

    MathSciNet  Google Scholar 

  68. Vizing V.G. (1968): Some unsolved problems in graph theory, Russian Math Surveys 23, 125–141.

    Article  MathSciNet  MATH  Google Scholar 

  69. Vizing V. (1976): Colouring the vertices of a graph with prescribed colours, Diskret. Analiz. 29, 3–10.

    MathSciNet  MATH  Google Scholar 

  70. Zykov A. (1949): On some problems of linear complexes, Mat. Sbornik N.S. 24, 163–188. English translation in Amer. Math. Soc. Transl. 79 (1952).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, Toronto, Canada

    Michael Molloy

Authors
  1. Michael Molloy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIRMM, 161, rue Ada, 34392, Montpellier Cedex 5, France

    Michel Habib

  2. Department of Statistics, University of Oxford, 1 South Parks Road, OX1 3TG, Oxford, UK

    Colin McDiarmid

  3. Equipe Combinatoire, Université Pierre et Marie Curie, Paris 6 Case 189, 4, place Jussieu, 75252, Paris Cedex 5, France

    Jorge Ramirez-Alfonsin  & Bruce Reed  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Molloy, M. (1998). The Probabilistic Method. In: Habib, M., McDiarmid, C., Ramirez-Alfonsin, J., Reed, B. (eds) Probabilistic Methods for Algorithmic Discrete Mathematics. Algorithms and Combinatorics, vol 16. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-12788-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-12788-9_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-08426-3

  • Online ISBN: 978-3-662-12788-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation