recent results on Ramsey-type numbers.

References: [1] Alon, N. , Explicit Ramsey graphs and orthonormal labelings, The Electronic Journal of Combinatorics, 1, #R12, (1994) · Zbl 0814.05056 [2] Alon, N. ; Pudlák, P., Constructive lower bounds for off-diagonal Ramsey numbers, Israel Journal of Mathematics, 122, 243-251, (2001) · Zbl 0988.05091 [3] Alon, N. ; Spencer, J., The probabilistic method, (2000), Wiley New York [4] B. Barak, A. Rao, R. Shaltiel, A. Wigderson, 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction, in: STOC, 2006, pp. 671-680. · Zbl 1301.68191 [5] Chung, F. ; Graham, R. , Erdős on graphs—his legacy of unsolved problems, (1998), A.K. Peters Wellesley · Zbl 0890.05049 [6] Codenotti, B. ; Pudlák, P.; Resta, G. , Some structural properties of low rank matrices related to computational complexity, Theoretical Computer Science, 235, 89-107, (2000) · Zbl 0938.68059 [7] Coles, J.; Radziszowski, S. , Computing the folkman number $F_v(2, 2, 3; 4)$, Journal of Combinatorial Mathematics and Combinatorial Computing, 58, 13-22, (2006) · Zbl 1116.05053 [8] Deuber, W. , Generalizations of ramsey’s theorem, (Hajnal, A.; etal., Infinite and Finite Sets, Keszthely, 1973, Colloquia Mathematica Societatis János Bolyai, vol. 10, (1975), North-Holland), 323-332 [9] A. Dudek, Problems in extremal combinatorics, Ph.D. Dissertation, Emory University, 2008. [10] Dudek, A. ; Rödl, V. , Finding folkman numbers via MAX-cut problem, (Liebling, Th.; Szwarcfiter, J.; Durán, G.; Matamala, M., LAGOS, Electronic Notes in Discrete Mathematics, vol. 30, (2008), Elsevier), 99-104 · Zbl 1341.05071 [11] Dudek, A. ; Rödl, V. , On the folkman number $f(2, 3, 4)$, Experimental Mathematics, 17, 1, 63-67, (2008) · Zbl 1152.05047 [12] Dudek, A. ; Rödl, V. , An almost quadratic bound on vertex folkman numbers, Journal of Combinatorial Theory, Series B, 100, 2, 132-140, (2010) · Zbl 1214.05055 [13] Erdős, P., Problems and results in finite and infinite graphs, (Fiedler, M., Recent Advances in Graph Theory, Proceedings of the Second Czechoslovak Symposium, (1975), Academia Praha), 183-192 [14] Erdős, P.; Hajnal, A. ; Pósa, L. , Strong embeddings of graphs into colored graphs, (Hajnal, A.; etal., Infinite and Finite Sets, Keszthely, 1973, Colloquia Mathematica Societatis János Bolyai, vol. 10, (1975), North-Holland), 585-595 [15] Folkman, J., Graphs with monochromatic complete subgraphs in every edge coloring, SIAM Journal on Applied Mathematics, 18, 19-24, (1970) · Zbl 0193.53103 [16] Fox, J.; Sudakov, B. , Induced Ramsey-type theorems, Advances in Mathematics, 219, 1771-1800, (2008) · Zbl 1152.05054 [17] Frankl, P.; Rödl, V. , Large triangle-free subgraphs in graphs without $K_4$, Graphs and Combinatorics, 2, 135-144, (1986) · Zbl 0596.05037 [18] Frankl, P.; Wilson, R. M. , Intersection theorems with geometric consequences, Combinatorica, 1, 4, 357-368, (1981) · Zbl 0498.05048 [19] Goodman, A. , On sets of acquaintances and strangers at any party, American Mathematical Monthly, 66, 778-783, (1959) · Zbl 0092.01305 [20] Graham, R. , On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon, Journal of Combinatorial Theory, 4, 300, (1968) · Zbl 0153.54102