On a combinatorial problem of Erdős, Kleitman and Lemke
نویسندگان
چکیده
منابع مشابه
On a combinatorial problem of Erds, Kleitman and Lemke
In this paper, we study a combinatorial problem originating in the following conjecture of Erdős and Lemke: given any sequence of n divisors of n, repetitions being allowed, there exists a subsequence the elements of which are summing to n. This conjecture was proved by Kleitman and Lemke, who then extended the original question to a problem on a zero-sum invariant in the framework of finite Ab...
متن کاملOn a combinatorial problem of Erdos, Kleitman and Lemke
— In this paper, we study a combinatorial problem originating in the following conjecture of Erdős and Lemke: given any sequence of n divisors of n, repetitions being allowed, there exists a subsequence the elements of which are summing to n. This conjecture was proved by Kleitman and Lemke, who then extended the original question to a problem on a zero-sum invariant in the framework of finite ...
متن کاملSperner's Theorem and a Problem of Erdős, Katona and Kleitman
A central result in extremal set theory is the celebrated theorem of Sperner from 1928, which gives the size of the largest family of subsets of [n] not containing a 2-chain F1 ⊂ F2. Erdős extended this theorem to determine the largest family without a k-chain F1 ⊂ F2 ⊂ . . . ⊂ Fk. Erdős and Katona, followed by Kleitman, asked how many chains must appear in families with sizes larger than the c...
متن کاملOn the Erdős Discrepancy Problem
According to the Erdős discrepancy conjecture, for any infinite ±1 sequence, there exists a homogeneous arithmetic progression of unbounded discrepancy. In other words, for any ±1 sequence (x1, x2, ...) and a discrepancy C, there exist integers m and d such that | ∑ m i=1 xi·d| > C. This is an 80-year-old open problem and recent development proved that this conjecture is true for discrepancies ...
متن کاملReflections on a Problem of Erdős and Hajnal
The problem I am going to comment reached me in 1987 at Memphis in a letter of Uncle Paul. He wrote: 'We have the following problem with Hajnal. If G(n) has n points and does not contain induced C4, is it true that it has either a clique or an independent set with n 10 points? Kind regards to your boss+ colleagues, kisses to the E -s.' E.P.' After noting that E have been used in different conte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2012
ISSN: 0001-8708
DOI: 10.1016/j.aim.2012.06.025