1

A Conjecture of Erdo .. s and the Ramsey Number r
– R J Faudree, B D McKay
 1993

1

An Upper Bound on the Ramsey Number R
– A F Sidorenko
 1991

1

The Ramsey Number of an N Edge Graph Versus Triangle Is at Most 2N + 1
– A F Sidorenko
 1993

1

An Extremal Problem in Gen
– Graph Theory
 1983

1

Some Small Ramsey Numbers, Journal of Graph Theory
– M Clancy
 1977

1

An Upper Bound on the Ramsey Number R (K , G ) Depending 3 . [ Only on the Size of the Graph
– A F Sidorenko
 1991

10

Generalizations of a RamseyTheoretic Result of Chvatal
– S A Burr, P Erdos
 1983

16

Some Small Ramsey Numbers
– M Clancy
 1977

1

An Upper Bound on the Ramsey Number R (K 3, G) Depending Only on the Size of the Graph
– A F Sidorenko

15

Treecomplete graph Ramsey numbers
– V Chvatal
 1977

4

Probabilistic methods in combinatorics, Probability and
– P Erdos, J Spencer
 1974

5

The maximum number of edges in 2k2free graphs of bounded degree
– Tuza, W T Trotter
 1990

2

Partition relations for uncountable ordinals
– James E Baumgartner
 1975

3

Countable Partition Ordinals
– Rene Schipperus
 1999

3

A local density condition for triangles
– P Erdős, R Faudree, C Rousseau, R Schelp
 1994

2

Covering the edges of a connected graph by paths
– L Pyber
 1996

2

The ascending subgraph decomposition problem, Congressus Numerantium 58
– Y Alavi, A J Boals, G Chartrand, P Erdős, O R Oellermann
 1987

2

On the ascending star subgraph decomposition of star forests
– K Ma, H Zhou, J Zhou
 1994

2

A partition relation for triples using a model of Todorčević
– E C Milner, K Prikry
 1991
