Ramsey Theory pp 177-189 | Cite as

Open Problems Session

Part of the Progress in Mathematics book series (PM, volume 285)


During the workshop Ramsey Theory Yesterday, Today and Tomorrow at Rutgers University on May 27-29, 2009, I offered a Problem Posing Session. All 30 participants of the workshop attended the session, and almost everyone came to the board and posed favorite open problems. The session was scheduled for an hour and lasted twice as long. I asked for problem submissions in writing for this volume. Below you will find all submitted problems (which is far from all the problems orally presented at the workshop). In addition, see many more open problems in the surveys of this volume. The survey by Ronald L. Graham and Eric Tressler, for one, consists entirely of open problems.


Chromatic Number Unicyclic Graph Combinatorial Proof Ramsey Number Polynomial Hale 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    V.Bergelson and A.Leibman. Polynomial extensions of van der Waerden’s and Szemerédi’s theorems. J. Am. Math. Soc.:725–753, 1996. http://www.math.ohio-state.edu/~vitaly/ or http://www.cs.umd.edu/~gasarch/vdw/vdw.html.Google Scholar
  2. [2]
    V.Bergelson and A.Leibman. Set-polynomials and polynomial extension of the Hales–Jewett theorem. Ann. Math., 150:33–75, 1999. http://www.math.ohio-state.edu/~vitaly/ or http://www.cs.umd.edu/~gasarch/vdw/vdw.html.Google Scholar
  3. [3]
    M.Walters. Combinatorial proofs of the polynomial van der Waerden theorem and the polynomial Hales–Jewett theorem. J. London Math. Soc., 61:1–12, 2000. http://jlms.oxfordjournals.org/cgi/reprint/61/1/1 or http://jlms.oxfordjournals.org/ or http://www.cs.umd.edu/~gasarch/vdw/vdw.html.Google Scholar
  4. [4]
    T.Gallai. Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hungar., 18:25–66, 1967.MathSciNetMATHCrossRefGoogle Scholar
  5. [5]
    A.Gyárfás and G.Simonyi. Edge colorings of complete graphs without tricolored triangles. J. Graph Theory, 46(3):211–216, 2004.MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.University of Colorado at Colorado Springs College of Letters, Arts, and SciencesColorado SpringsUSA

Personalised recommendations