Games, Randomness and Algorithms

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 Lovasz [19] and Erdős and Chvatal [15].

[1]  József Beck,et al.  Remarks on positional games. I , 1982 .

[2]  C. Nash-Williams.  Edge-disjoint spanning trees of finite graphs , 1961 .

[3]  József Beck,et al.  Van der waerden and ramsey type games , 1981, Comb..

[4]  József Beck,et al.  Variations on a Game , 1982, J. Comb. Theory, Ser. A.

[5]  A. Hales,et al.  Regularity and Positional Games , 1963 .

[6]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[7]  L. Pósa,et al.  Hamiltonian circuits in random graphs , 1976, Discret. Math..

[8]  Alfred Lehman,et al.  A Solution of the Shannon Switching Game , 1964 .

[9]  R. D. Baker.  Symmetric designs with bruck subdesigns , 1982, Comb..

[10]  E. Berlekamp,et al.  Winning Ways for Your Mathematical Plays , 1983 .

[11]  József Beck,et al.  Deterministic Graph Games and a Probabilistic Intuition , 1994, Combinatorics, Probability and Computing.

[12]  P. Erdös,et al.  Biased Positional Games , 1978 .

[13]  József Beck.  Parallel Matching Complexity of Ramsey's Theorem , 1990, Advances In Computational Complexity Theory.

[14]  József Beck,et al.  There is no fast method for finding monochromatic complete subgraphs , 1983, J. Comb. Theory, Ser. B.

[15]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[16]  Béla Bollobás,et al.  Random Graphs , 1985 .

[17]  Ethan D. Bloch.  Infinite and Finite Sets , 2003 .

[18]  Vojtech Rödl,et al.  The Ramsey number of a graph with bounded maximum degree , 1983, J. Comb. Theory, Ser. B.

[19]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[20]  József Beck.  On Positional Games , 1981, J. Comb. Theory, Ser. A.

[21]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[22]  József Beck,et al.  Random Graphs and Positional Games on the Complete Graph , 1985 .

[23]  Paul Erdös,et al.  On a Combinatorial Game , 1973, J. Comb. Theory, Ser. A.

[24]  József Beck,et al.  An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.

[25]  László Lovász,et al.  Finite and infinite sets , 1984 .

[26]  P. Erdös.  Some remarks on the theory of graphs , 1947 .