Erdős–Szekeres‐type theorems for monotone paths and convex bodies

For any sequence of positive integers j1

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

[2]  R. P. Dilworth,et al.  A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .

[3]  de Ng Dick Bruijn,et al.  On the set of divisors of a number , 1951 .

[4]  Miss A.O. Penney.  (b) , 1974, The New Yale Book of Quotations.

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

[6]  József Beck,et al.  On size Ramsey number of paths, trees, and circuits. I , 1983, J. Graph Theory.

[7]  T. Bisztriczky,et al.  A generalization of the Erdös-Szekeres convex n-gon theorem. , 1989 .

[8]  R. Graham,et al.  Ramsey theory (2nd ed.) , 1990 .

[9]  Tibor Bisztriczky,et al.  Convexly independent sets , 1990, Comb..

[10]  Jj Anos Pach.  Erd} Os-szekeres-type Theorems for Segments and Non-crossing Convex Sets , 1998 .

[11]  János Pach,et al.  A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets , 1998, Discret. Comput. Geom..

[12]  János Pach,et al.  Erdős–Szekeres-Type Theorems for Segments and Noncrossing Convex Sets , 2000 .

[13]  Vojtech Rödl,et al.  On Size Ramsey Numbers of Graphs with Bounded Degree , 2000, Comb..

[14]  P. Erdgs,et al.  ON MAXIMAL PATHS AND CIRCUITS OF GRAPHS , 2002 .

[15]  Yoshiharu Kohayakawa,et al.  Ramsey Games Against a One-Armed Bandit , 2003, Comb. Probab. Comput..

[16]  Andrzej Rucinski,et al.  Two variants of the size Ramsey number , 2005, Discuss. Math. Graph Theory.

[17]  Tomasz Luczak,et al.  The Ramsey number for a triple of long even cycles , 2007, J. Comb. Theory, Ser. B.

[18]  Endre Szemerédi,et al.  Three-Color Ramsey Numbers For Paths , 2007, Comb..

[19]  Endre Szemerédi,et al.  Three-color Ramsey numbers for paths , 2008, Comb..

[20]  Vojtech Rödl,et al.  On the Ramsey Number of Sparse 3-Graphs , 2008, Graphs Comb..

[21]  János Pach,et al.  Families of convex sets not representable by points , 2008 .

[22]  D. Conlon,et al.  Hypergraph Ramsey numbers , 2008, 0808.3760.

[23]  Daniela Kühn,et al.  Embeddings and Ramsey numbers of sparse κ-uniform hypergraphs , 2006, Comb..

[24]  Edy Tri Baskoro,et al.  On Ramsey-Type Problems , 2009 .

[25]  Vojtech Rödl,et al.  The Ramsey Number for 3-Uniform Tight Hypergraph Cycles , 2009, Combinatorics, Probability and Computing.

[26]  David Conlon,et al.  Ramsey numbers of sparse hypergraphs , 2007, Random Struct. Algorithms.

[27]  David Conlon,et al.  On-line Ramsey Numbers , 2009, SIAM J. Discret. Math..

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

[29]  Andrew Suk.  On Order Types of Systems of Segments in the Plane , 2010, Order.

[30]  Jane Butterfield,et al.  Online Ramsey games for triangles in random graphs , 2010, Discret. Math..

[31]  Yoshiharu Kohayakawa,et al.  Sparse partition universal graphs for graphs of bounded degree , 2011 .

[32]  Alfredo Hubard,et al.  Order Types of Convex Bodies , 2010, Order.

[33]  Reto Spöhel,et al.  Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games , 2012, SIAM J. Discret. Math..

[34]  David Conlon,et al.  An improved bound for the stepping-up lemma , 2009, Discret. Appl. Math..