On a covering problem in the hypercube

Details On a covering problem in the hypercube On a covering problem in the hypercube

2011-10-02

arxiv.org/abs/1110.0224v1

Mathematics

Combinatorics

8 pages

Scientific paper

In this paper, we address a particular variation of the Tur\'an problem for the hypercube. Alon, Krech and Szab\'o (2007) asked "In an n-dimensional hypercube, Qn, and for l < d < n, what is the size of a smallest set, S, of Q_l's so that every Q_d contains at least one member of S?" Likewise, they asked a similar Ramsey type question: "What is the largest number of colors that we can use to color the copies of Q_l in Q_n such that each Q_d contains a Q_l of each color?" We give upper and lower bounds for each of these questions and provide constructions of the set S above for some specific cases.

Affiliated with

Also associated with

No associations

Rating

On a covering problem in the hypercube 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 On a covering problem in the hypercube, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a covering problem in the hypercube will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-270094