Abstract
The object of this 50 % survey and 50 % “theorem-proof” paper is to demonstrate recent developments of some of the ideas initiated by Erdős [17, 18], Erdős and Selfridge [201], Erdős and Lovász [19] and Erdős and Chvátal [15].
Cite
CITATION STYLE
APA
Beck, J. (2013). Games, randomness and algorithms. In The Mathematics of Paul Erdos I, Second Edition (pp. 311–342). Springer New York. https://doi.org/10.1007/978-1-4614-7258-2_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free