Page 1

Displaying 1 – 7 of 7

Showing per page

Combinatorics and quantifiers

Jaroslav Nešetřil (1996)

Commentationes Mathematicae Universitatis Carolinae

Let I m be the set of subsets of I of cardinality m . Let f be a coloring of I m and g a coloring of I m . We write f g if every f -homogeneous H I is also g -homogeneous. The least m such that f g for some f : I m k is called the k -width of g and denoted by w k ( g ) . In the first part of the paper we prove the existence of colorings with high k -width. In particular, we show that for each k > 0 and m > 0 there is a coloring g with w k ( g ) = m . In the second part of the paper we give applications of wide colorings in the theory of generalized quantifiers....

Currently displaying 1 – 7 of 7

Page 1