Skip to main content
SpringerLink
Log in

Probabilistic methods in graph theory

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

One of the lessons Paul Erdös taught us is that probabilistic counting arguments often yield surprisingly strong existence results in combinatorics. This paper illustrates the paradigm on four examples drawn from Erdös's own work. The examples concern the chromatic number of a graph.

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

Similar content being viewed by others

References

  1. P.A. Catlin, Hajós' graph coloring conjecture: variantions and counter examples, J. Comb. Theory B26 (1979) 268.

    Google Scholar 

  2. V. Chvátal, The tail of the hypergeometric distribution, Discr. Math. 25 (1979) 285.

    Google Scholar 

  3. B. Descartes, Solution to Advanced Problem no. 4526, Amer. Math. Monthly 61 (1954) 352.

    Google Scholar 

  4. G.A. Dirac, A property of 4-chromatic graphs and some remarks on critical graphs, J. London Math. Soc. 27 (1952) 85.

    Google Scholar 

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

    Google Scholar 

  6. P. Erdös, Graph theory and probability, Can. J. Math. 11 (1959) 34.

    Google Scholar 

  7. P. Erdös, On circuits and subgraphs of chromatic graphs, Mathematika 9 (1962) 170.

    Google Scholar 

  8. P. Erdös and A. Fajtlowicz, On the conjecture of Hajós, Combinatorica 1 (1981) 141.

    Google Scholar 

  9. P. Erdös and A. Rényi, On the evolution of random graphs, A. Magyar Tudományos Akadémia Matematikai Kutató Intézetének Kòzleményei 5 (1960) 17.

    Google Scholar 

  10. P. Erdös and J. Spencer, Probabilistic Methods in Combinatorics (Academic Press, New York, 1974).

    Google Scholar 

  11. P. Frankl and R.M. Wilson, Intersection theorems with geometric consequences, Combinatorica 1 (1981) 357.

    Google Scholar 

  12. G. Hajós, Über eine Konstruktion nichtn-Farbbarer Graphes, Wiss. Z. Martin Luther Univ. Halle-Wittenberg Math. Naturwiss. Reihe 10 (1961) 116.

    Google Scholar 

  13. W. Hoeffding, Probability inequalities for sums of bounded random variables, J. Amer. Stat. Assoc. 58 (1963) 13.

    Google Scholar 

  14. L. Lovász, Chromatic number of finite set-systems, Acta Math. Academiae Scientiarum Hungaricae 19 (1958) 56.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, McGill University, H3A 2K6, Montreal, Canada

    V. Chvátal

Authors
  1. V. Chvátal
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Technical Report SOCS-8218, November 1982.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chvátal, V. Probabilistic methods in graph theory. Ann Oper Res 1, 171–182 (1984). https://doi.org/10.1007/BF01874387

Download citation

  • Issue Date:

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

Keywords and phrases

Search

Navigation