Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. P. Erdős, A. Hajnal and Zs. Tuza, Local constraints ensuring small representing sets, J. Combin. Theory Ser. A 58 (1991), no. 1, 78--84, write when every -uniform set system whose subsystems on at most elements can each be covered by one element can itself be covered by elements, and for the least such . The best of Problem 616 is . Their Theorem 3 (p. 80) proves the upper bound
as a particular case of their Theorem 6 (Section 4, pp. 83--84; the check that is on p. 84). The prose after Theorem 3 states the lower bound , from the set systems of Section 3, and p. 84 gives the construction: with , and , every subsystem of on at most elements is covered by one element, while the whole system has covering number . So
Covers. The value for exactly the at which the two bounds meet: --, --, --, --, --, --, --, , , , , , , , and , thirty-eight values in all, with for , for , and so on up to at . For every other , and so for every , the bounds differ and the best is not determined.
Depends on. Nothing in this wiki; the proofs are the paper's own.
Acceptance. Refereed: Journal of Combinatorial Theory, Series A 58
(1991), no. 1, 78--84, received 2 July 1989; the publisher's record dates the
issue September 1991, and the page's date is the month's first day. The site
labels the problem OPEN and credits the paper only with the two bounds, so
reviewed is not listed. No independent proof review and no formalization
are recorded.