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].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Partially supported by NSF Grant # DMS-9106631.
Bibliography
N. Alon, and J. Spencer, The Probabilistic Method, Academic Press, New York, 1992.
J. Baumgartner, F. Galvin, R. Laver and R. McKenzie, Game theoretic versions of partition relations, in: Colloq. Math. Soc. János Bolyai “Infinite and Finite sets” Keszthely, Hungary, 1973, 131–135.
J. Beck, On positional games, Journal of Combinatorial Theory, ser. A 30 (1981), 117–133.
J. Beck, Van der Waerden and Ramsey type games, Combinatorica 2 (1981), 103–116.
J. Beck, Remarks on positional games - Part I, Acta Math. Acad. Sci. Hungarica (1–2) 40 (1982), 65–71.
J. Beck, There is no fast method for finding monochromatic complete subgraphs, Journal of Combinatorial Theory, ser. B 34 (1983), 58–64.
J. Beck, Random graphs and positional games on the complete graph, Annals of Discrete Math. 28 (1985), 7–13.
J. Beck, An algorithmic approach to the Lovász Local Lemma. I., Random Structures and Algorithms 2 (1991), 343–365.
J. Beck, Parallel matching complexity of Ramsey’s theorem, manuscript (1992).
J. Beck, Deterministic graph games and a probabilistic intuition, manuscript (1993).
J. Beck and L. Csirmaz, Variations on a game, Journal of Combinatorial Theory, ser. A 33 (1982), 297–315.
C. Berge, Sur les jeux positionelles, Cahiers Centre Études Rech. Opér. 18 (1976).
E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, London, 1982.
B. Bollobás, Random Graphs, Academic Press, London, 1985.
V. Chvátal and P. Erdős, Biased positional games, Annals of Discrete Math. 2 (1978), 221–228.
V. Chvátal, V. Rödl, E. Szemerédi and W. T. Trotter, The Ramsey number of a graph with bounded maximum degree, Journal of Combinatorial Theory, series B 34 (1983), 239–243.
P. Erdős, Some remarks on the theory of graphs, Bull. Amer. Math, Soc. 53 (1947), 292–294.
P. Erdős, On a combinatorial problem, I, Nordisk. Mat. Tidskr. 11 (1963), 5–10.
P. Erdős and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, in: Infinite and Finite Sets (eds.: A. Hajnal et al.), Colloq. Math. Soc. J. Bolyai, 11, North-Holland, Amsterdam, 1975, 609–627.
P. Erdős and J. Selfridge, J, On a combinatorial game, Journal of Combinatorial Theory, ser. A 14 (1973), 298–301.
A. W. Hales and R. I. Jewett, On regularity and positional games, Trans. Amer. Math. Soc. 106 (1963), 222–229.
J. Komlós and E. Szemerédi, Hamilton cycles in random graphs, in: Proc. of the Combinatorial Colloquium in Keszthely, Hungary, 1973, 1003–1010.
A. Lehman, A solution to the Shannon switching game, SIAM Journ. Appl. Math. 12 (1964),687–725.
L. Lovász, Combinatorial Problems and Exercises, North-Holland and Akadémia Kiadó, 1979.
C. St. J. A. Nash-Williams, Edge-disjoint spanning trees of finite graphs, Journ. London Math. Soc. 36 (1961), 445–450.
L. Pósa, Hamilton circuits in random graphs, Discrete Math. 14 (1976), 359–364.
L. A. Székely, On two concepts of discrepancy in a class of combinatorial games, in: Colloq. Math. Soc. János Bolyai 37 “Finite and Infinite Sets” Eger, Hungary, 1981, North-Holland, 679–683.
W. T. Tutte, On the problem of decomposing a graph into n connected factors, Journ. London Math. Soc. 36 (1961), 221–230.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Beck, J. (2013). Games, Randomness and Algorithms. In: Graham, R., Nešetřil, J., Butler, S. (eds) The Mathematics of Paul Erdős I. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7258-2_21
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7258-2_21
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-7257-5
Online ISBN: 978-1-4614-7258-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)