A Partition Theorem

Details A Partition Theorem A Partition Theorem

2000-03-25

arxiv.org/abs/math/0003163v1

Mathematics

Combinatorics

Scientific paper

We prove the following: there is a primitive recursive function f_-^*(-,-), in the three variables, such that: for every natural numbers t,n>0, and c, for any natural number k>=f^*_t(n,c) the following holds. Assume L is an alphabet with n>0 letters, M is the family of non empty subsets of {1,...,k} with =

Affiliated with

Also associated with

No associations

Rating

A Partition Theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Partition Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Partition Theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-149631