Name
Abstract | ||
|---|---|---|
A family of subsets of an n -set is 4-locally thin if for every quadruple of its members the ground set has at least one element contained in exactly 1 of them. We show that such a family has at most 2 0.4561 n members. This improves on our previous results with Noga Alon. The new proof is based on a more careful analysis of the self-similarity of the graph associated with such set families by the graph entropy bounding technique. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1006/jcta.2000.3162 | J. Comb. Theory, Ser. A |
Keywords | Field | DocType |
thin set family | Discrete mathematics,Family of sets,Graph,Combinatorics,Graph entropy,Thin set,Mathematics,Bounding overwatch | Journal |
Volume | Issue | ISSN |
95 | 2 | Journal of Combinatorial Theory, Series A |
Citations | PageRank | References |
3 | 0.45 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emanuela Fachini | 1 | 39 | 11.83 |
| János Korner | 2 | 138 | 20.27 |
| Angelo Monti | 3 | 671 | 46.93 |