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 [1] 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Erdős, Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292–294.
P. Erdős, Problems and results in additive number theory, in Colloque sur la Théorie des Nombres (CBRM), Bruxelles, 1955, 127–137.
P. Erdôs, Graph Theory and Probability, Canad. J. Math. 11 (1959), 34–38.
P. Erdôs, Graph Theory and Probability II., Canad. J. Math. 13 (1961), 346–352.
P. Erdôs, On circuits and subgraphs of chromatic graphs, Mathematika 9(1962), 170–175.
P. Erdôs, On a combinatorial problem I., Nordisk. Mat. Tidskr. 11 (1963), 5–10.
P. Erdôs, On a combinatorial problem IL, Acta. Math. Acad. Sci. Hungar. 15 (1964), 445–447.
P. Erdôs and J. W. Moon, On sets of consistent arcs in a tournament, Canad. Math. Bull. 8 (1965), 269–271.
P. Erdôs and À. Rényi, On the evolution of random graphs, Mat. Kutató Int. közl. 5 (1960), 17–60.
P. Erdôs and J. Spencer, Imbalances in k-colorations. Networks 1 (1972), 379–385.
P. Erdôs and G. Szekeres, A combinatorial problem in geometry, Compositio Math. 2(1935), 463–470.
W. F. de la Vega, On the maximal cardinality of a consistent set of arcs in a random tournament, J. Combinatorial Theory, Series B 35 (1983), 328–332.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Spencer, J. (1997). The Erdôs Existence Argument. In: Graham, R.L., Nešetřil, J. (eds) The Mathematics of Paul Erdös I. Algorithms and Combinatorics, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60408-9_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-60408-9_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64394-1
Online ISBN: 978-3-642-60408-9
eBook Packages: Springer Book Archive