1 February 2000 in Combinatorica
26 May 2016 in Journal of Graph Theory
1 November 2000 in Combinatorics, Probability and Computing
A family of subsets of an n-set is k-locally thin if, for every k of its member sets, the ground set has at least one element contained in exactly 1 of them. We derive new asymptotic upper bounds for the maximum cardinality of locally thin set families for every even k. This improves on previous results of two of the authors with Monti.
10 November 2017 in Journal of Graph Theory
11 November 2015 in IEEE Transactions on Information Theory
We begin a systematic study of the problem of the zero-error capacity of noisy binary channels with memory and solve some of the non-trivial cases.
1 September 2000 in Combinatorics, Probability and Computing
Let M(n, A) denote the maximum possible cardinality of a family of binary strings of length n, such that for every four distinct members of the family there is a coordinate in which exactly two of them have a 1. We prove that M(n, A) [les ] 20.78n for all sufficiently large n. Let M(n, C) denote the maximum possible cardinality of a family of binary strings of length n, such that for every four distinct members of the family there is a coordinate in which exactly one of them has a 1. We show that there is an absolute constant c < 1/2 such that M(n, C) [les ] 2cn for all sufficiently large n. Some related questions are discussed as well.