Some recent results on Ramsey-type numbers

Authors:
Andrzej Dudek;Peter Frankl;Vojtch RöDl
Affiliations:
Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, United States;Peter Frankl Office, Ltd., 3-12-25 Shibuya, Shibuya-ku, Tokyo 150-0002, Japan;Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, United States
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 8
Cited 0

Three hundred million points suffice

Journal of Combinatorial Theory Series A
Some structural properties of low-rank matrices related to computational complexity

Theoretical Computer Science - Selected papers in honor of Manuel Blum
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Explicit Construction of Small Folkman Graphs

SIAM Journal on Discrete Mathematics
Computation of the Folkman number Fe(3, 3; 5)

Journal of Graph Theory
An almost quadratic bound on vertex Folkman numbers

Journal of Combinatorial Theory Series B
Some constructive bounds on Ramsey numbers

Journal of Combinatorial Theory Series B
The Ramsey number R(3, t) has order of magnitude t2/log t

Random Structures & Algorithms

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper we survey the authors' recent results on quantitative extensions of Ramsey theory. In particular, we discuss our recent results on Folkman numbers, induced bipartite Ramsey graphs, and explicit constructions of Ramsey graphs.