β Scribed by Stefan Neumann
No coin nor oath required. For personal study only.
We replace Shelah's notion of true coΓΏnality by the notion of the bounding number for an arbitrary partial order and begin to develop a theory similar to Shelah's pcf theory, which gives many analog results, including the existence of the so-called generators, for the more general case of products of partial orders. The development can be strictly divided into an ideal theoretical and a combinatorial part. We also show that pcf theory is a special case of this more general theory and conclude with some remarks about Shelah's function pp( ), which also show that there are some di erences between pcf theory and the presented theory of bounding numbers.
π SIMILAR VOLUMES
Topp, J. and L. Volkmann, Some upper bounds for the product of the domination number and the chromatic number of a graph, Discrete Mathematics 118 (1993) 2899292. Some new upper bounds for yx are proved, where y is the domination number and x is the chromatic number of a graph. All graphs consider