Orientation Games and Minimal Ramsey Graphs

[1]  Tom Bohman,et al.  Dynamic concentration of the triangle‐free process , 2013, Random Struct. Algorithms.

[2]  Yury Person,et al.  On the minimum degree of minimal Ramsey graphs , 2010, J. Comb. Theory, Ser. B.

[3]  Anita Liebenau,et al.  The Random Graph Intuition for the Tournament Game , 2013, Combinatorics, Probability and Computing.

[4]  Andrzej Dudek,et al.  On generalized Ramsey numbers of Erdős and Rogers , 2014, J. Comb. Theory, Ser. B.

[5]  Andrzej Dudek,et al.  On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs , 2013, J. Graph Theory.

[6]  Gonzalo Fiz Pontiveros,et al.  The triangle-free process and R(3,k) , 2013 .

[7]  Benny Sudakov,et al.  Biased orientation games , 2012, Discret. Math..

[8]  Heidi Gebauer,et al.  On the clique-game , 2012, Eur. J. Comb..

[9]  S. Radziszowski.  Small Ramsey Numbers , 2011 .

[10]  Andrzej Dudek,et al.  On Ks-free subgraphs in Ks+k-free graphs and vertex Folkman numbers , 2011, Comb..

[11]  Tibor Szabó,et al.  Asymptotic random graph intuition for the biased connectivity game , 2009, Random Struct. Algorithms.

[12]  G. Szekeres,et al.  A combinatorial problem in geometry , 2009 .

[13]  T. Bohman.  The triangle-free process , 2008, 0806.4375.

[14]  Vojtech Rödl,et al.  On Ramsey Minimal Graphs , 2008, SIAM J. Discret. Math..

[15]  Michael Krivelevich,et al.  Planarity, Colorability, and Minor Games , 2008, SIAM J. Discret. Math..

[16]  Jacob Fox,et al.  The minimum degree of Ramsey-minimal graphs , 2007 .

[17]  D. Conlon.  A new upper bound for diagonal Ramsey numbers , 2006, math/0607788.

[18]  Tibor Szabó,et al.  Positional games on random graphs , 2006, Random Struct. Algorithms.

[19]  Xiaodong Xu,et al.  Constructive Lower Bounds on Classical Multicolor Ramsey Numbers , 2004, Electron. J. Comb..

[20]  Lingsheng Shi,et al.  Upper bounds for Ramsey numbers , 2003, Discret. Math..

[21]  Ingo Schiermeyer,et al.  The Ramsey number r(C7, C7, C7) , 2003, Discuss. Math. Graph Theory.

[22]  Tomasz Luczak,et al.  Biased Positional Games for Which Random Strategies are Nearly Optimal , 2000, Comb..

[23]  Béla Bollobás,et al.  The oriented cycle game , 1998, Discret. Math..

[24]  Honghui Wan.  Upper bounds for Ramsey numbers R (3,3,…,3) and Schur numbers , 1997 .

[25]  Michael Krivelevich,et al.  Ks-Free Graphs Without Large Kr-Free Subgraphs , 1994, Combinatorics, Probability and Computing.

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

[27]  Rephael Wenger,et al.  Extremal graphs with no C4's, C6's, or C10's , 1991, J. Comb. Theory, Ser. B.

[28]  Béla Bollobás,et al.  Graphs without large triangle free subgraphs , 1991, Discret. Math..

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

[30]  Vojtech Rödl,et al.  On the use of senders in generalized ramsey theory for graphs , 1985, Discret. Math..

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

[32]  James B. Shearer,et al.  A note on the independence number of triangle-free graphs , 1983, Discret. Math..

[33]  János Komlós,et al.  A Note on Ramsey Numbers , 1980, J. Comb. Theory, Ser. A.

[34]  P. Erdos,et al.  The size Ramsey number , 1978 .

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

[36]  Joel H. Spencer,et al.  Asymptotic lower bounds for Ramsey functions , 1977, Discret. Math..

[37]  V. Rödl,et al.  The Ramsey property for graphs with forbidden complete subgraphs , 1976 .

[38]  P. Erdös,et al.  ON GRAPHS OF RAMSEY TYPE , 1976 .

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

[40]  Frank Harary,et al.  Generalized ramsey theory for graphs, I. Diagonal numbers , 1973 .

[41]  Frank Harary,et al.  Generalized Ramsey theory for graphs , 1972 .

[42]  H. L. Abbott,et al.  A problem of Schur and its generalizations , 1972 .

[43]  P. Erdos,et al.  On chromatic number of graphs and set-systems , 1966 .

[44]  Paul Erdös,et al.  The Construction of Certain Graphs , 1966, Canadian Journal of Mathematics.

[45]  R. Greenwood,et al.  Combinatorial Relations and Chromatic Graphs , 1955, Canadian Journal of Mathematics.

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

[47]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .