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
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/}
}
Cité par Sources :