The Erdős Existence Argument

Joel Spencer ()
Additional contact information
Joel Spencer: New York University, Courant Institute

A chapter in The Mathematics of Paul Erdős I, 2013, pp 435-444 from Springer

Abstract: Summary The Probabilistic Method is now a standard tool in the combinatorial toolbox but such was not always the case. The development of this methodology was for many years nearly entirely due to one man: Paul Erdős. Here we reexamine some of his critical early papers. We begin, as all with knowledge of the field would expect, with the 1947 paper Erdős P (1947) Some remarks on the theory of graphs. Bull Amer Math Soc 53:292–294 giving a lower bound on the Ramsey function R(k, k). There is then a curious gap (certainly not reflected in Erdős’s overall mathematical publications) and our remaining papers all were published in a single ten year span from 1955 to 1965.

Keywords: Failure Probability; Random Graph; Complete Graph; Chromatic Number; Local Coloring (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-7258-2_27

Ordering information: This item can be ordered from
http://www.springer.com/9781461472582

DOI: 10.1007/978-1-4614-7258-2_27

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().