Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T21:19:03.717Z Has data issue: false hasContentIssue false

On Finite Polarized Partition Relations

Published online by Cambridge University Press:  20 November 2018

V. Chvátal*
Affiliation:
University of New Brunswick, Fredericton
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1969