# Ramsey's theorem

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2009

2009

- Arch. Math. Log.
- 2009

We study the effective and proof-theoretic content of the polarized Ramsey’s theorem, a variant of Ramsey’s theorem obtained by… (More)

Is this relevant?

2009

2009

- J. Symb. Log.
- 2009

It was shown by Cholak, Jockusch, and Slaman that every computable 2-coloring of pairs admits an infinite low2 homogeneous set H… (More)

Is this relevant?

2009

2009

- J. Symb. Log.
- 2009

The Rainbow Ramsey Theorem is essentially an “anti-Ramsey” theorem which states that certain types of colorings must be injective… (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- J. Symb. Log.
- 2007

We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of… (More)

Is this relevant?

1985

1985

- Graphs and Combinatorics
- 1985

An edge-coloring of a graph is a partition of the set of edges into color-classes such that no two edges in the same class are… (More)

Is this relevant?

Highly Cited

1983

Highly Cited

1983

- Journal of Graph Theory
- 1983

The size Ramsey number i ( G ) of a graph G is the smallest integer i such that there is a graph F of i edges with the property… (More)

Is this relevant?

1979

1979

- J. Comb. Theory, Ser. A
- 1979

We prove a Ramsey theorem for trees. The infinite version of this theorem GUI be stated: if T is a rooted tree of infinite height… (More)

Is this relevant?

1979

1979

- 1979

A short proof is given of the following known result. For all k, r, t there exists n so that if the /-spaces of an n-space are… (More)

Is this relevant?

Highly Cited

1978

Highly Cited

1978

- 1978

Let i2 denote the class of all graphs G which satisfy G-(Gl, GE). As a way of measuring r inimality for members of P, we define… (More)

Is this relevant?

Highly Cited

1977

Highly Cited

1977

- Discrete Mathematics
- 1977

The probabilisrk mefkod is a powerful technique for approaching asymptotic combinatorial problems. This paper considers an… (More)

Is this relevant?