Name
Abstract | ||
|---|---|---|
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) ≤ 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 M(n, C) ≤ 2cn for all sufficiently large n. Some related questions are discussed as well. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1017/S0963548300004375 | Combinatorics, Probability & Computing |
Keywords | Field | DocType |
distinct member,length n,absolute constant c,maximum possible cardinality,large n,related question,binary string,string quartets | Discrete mathematics,Combinatorics,Binary strings,Cardinality,Mathematics,Binary number | Journal |
Volume | Issue | ISSN |
9 | 5 | 0963-5483 |
Citations | PageRank | References |
6 | 1.26 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Noga Alon | 1 | 10468 | 1688.16 |
| János Körner | 2 | 6 | 1.26 |
| Angelo Monti | 3 | 671 | 46.93 |