Publications of (and about) Paul Erdös
Autor: Bonnet, R.; Erdös, Paul
Title: The chromatic index of an infinite complete hypergraph: A partition theorem. (In English)
Source: Proc. 1rst Working Sem. Hypergraphs, Columbus 1972, Lecture Notes Math. 411, 54-60 (1974).
Review: [For the entire collection see Zbl 282.00007.]
Let p,m and n be three cardinals such that p < m < n and 1 < p < \omega \leq n, and let S denote a set of cardinality n. The authors show, assuming the axiom of choice, that the m-tuples of S can be coloured with nm colours such that every p-tuple of S is contained in exactly one m-tuple of each colour.
Classif.: * 05C15 Chromatic theory of graphs and maps
05C99 Graph theory
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag