We present a very simple proof of the fact (due to P. Erd~s and R. Rado) that Ram~ey's theorem doesn't hold for partitions of infinite subsets. We also present a proof of an induced Ramsey theorem for partitions of complete subgraphs (due to W. Deuber and authors) based on the theorem of R. Graham a
Remarks on Alvin Gouldner'sthe two marxisms
β Scribed by Douglas Kellner
- Publisher
- Springer Netherlands
- Year
- 1981
- Tongue
- English
- Weight
- 815 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0304-2421
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In the first part of this paper, those Steiner systems S (3, k, v) are studied in which the set of blocks, or the set of point-pairs, provided with the 'natural' relations, forms an association scheme. Inequalities connecting v and k are derived. These are used to obtain 'geometric' characterisation
The notion of coloring number of a graph was introduced by P. Erdo s and A. Hajnal in [2] in order to investigate the chromatic number of infinite graphs. For a graph G its coloring number, Col(G) is defined to be the least cardinal } for which there is a well ordering of the vertex set in which eve
DEDICATED TO THE MEMORY OF NORMAN LEVINSON 1. The definition of W(P), g iven by Stein, uses n-dimensional analogs of conjugate functions. This generalization of the classical Hardy space is of course only one of several possible ones. It has however proved to be of intrinsic importance through its r