Paper detail

On a covering problem in the hypercube

In this paper, we address a particular variation of the Turán problem for the hypercube. Alon, Krech and Szabó (2007) asked &#34;In an n-dimensional hypercube, Qn, and for l < d < n, what is the size of a smallest set, S, of Q_l&#39;s so that every Q_d contains at least one member of S?&#34; Likewise, they asked a similar Ramsey type question: &#34;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?&#34; We give upper and lower bounds for each of these questions and provide constructions of the set S above for some specific cases.

preprint2011arXivOpen access
0citations
0reviews
0saves
Nocode
Nodataset
0institutions

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.