On Finite Polarized Partition Relations
Canadian mathematical bulletin, Tome 12 (1969) no. 3, pp. 321-326

Voir la notice de l'article provenant de la source Cambridge University Press

Call an m × n array an m × n; k array if its mn entries come from a set of k elements. An m × n; 1 array has mn like entries. We write (1) if every m × n; k array contains a p × q; 1 sub-array. The negation of (1) is written and means that there is an m × n; k array containing no p × q; 1 sub-array. Relations (1) are called "polarized partition relations among cardinal numbers" by P. Erdös and R. Rado [2]. In this note we prove the following theorems.
Chvátal, V. On Finite Polarized Partition Relations. Canadian mathematical bulletin, Tome 12 (1969) no. 3, pp. 321-326. doi: 10.4153/CMB-1969-040-1
@article{10_4153_CMB_1969_040_1,
     author = {Chv\'atal, V.},
     title = {On {Finite} {Polarized} {Partition} {Relations}},
     journal = {Canadian mathematical bulletin},
     pages = {321--326},
     year = {1969},
     volume = {12},
     number = {3},
     doi = {10.4153/CMB-1969-040-1},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1969-040-1/}
}
TY  - JOUR
AU  - Chvátal, V.
TI  - On Finite Polarized Partition Relations
JO  - Canadian mathematical bulletin
PY  - 1969
SP  - 321
EP  - 326
VL  - 12
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1969-040-1/
DO  - 10.4153/CMB-1969-040-1
ID  - 10_4153_CMB_1969_040_1
ER  - 
%0 Journal Article
%A Chvátal, V.
%T On Finite Polarized Partition Relations
%J Canadian mathematical bulletin
%D 1969
%P 321-326
%V 12
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1969-040-1/
%R 10.4153/CMB-1969-040-1
%F 10_4153_CMB_1969_040_1

[1] 1. Erdös, P., Some remarks on the theory of graphs. Bull. Amer. Math. Soc. 53 (1947) 292–299. Google Scholar

[2] 2. Erdös, P. and Rado, R., A partition calculus in set theory. Bull. Amer. Math. Soc. 62 (1956) 427–489. Google Scholar

[3] 3. Frasnay, C., Partages d'ensembles de parties et de produits d'ensembles. C.R.Acad. Sci. Paris 258 (1964) 1373–1376. Google Scholar

[4] 4. Guy, R.K., A problem of Zarankiewicz, Theory of graphs (edited by P. Erdos and G. Katona, Akademiai Kiado, Budapest 1968) 119–150. Google Scholar

[5] 5. Zarankiewicz, K., Problem PI 01. Colloq. Math. 2 (1951) 301. Google Scholar

Cité par Sources :