| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654907 | European Journal of Combinatorics | 2006 | 12 Pages |
Abstract
Let be an nn-uniform hypergraph on 2n2n vertices. Suppose that |F1∩F2∩F3∩F4|≥2|F1∩F2∩F3∩F4|≥2 and |F1∪F2∪F3∪F4|≤n−2|F1∪F2∪F3∪F4|≤n−2 hold for all F1,F2,F3,F4∈F1,F2,F3,F4∈. We prove that the size of is at most 2n−4n−2 for nn sufficiently large.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Norihide Tokushige,