| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656446 | Journal of Combinatorial Theory, Series A | 2006 | 15 Pages |
Abstract
We construct a 12-uniform hypergraph on n vertices with size (n/12)6 which satisfies |F∩F′|∈{0,1,2,3,4,6} for all distinct edges F and F′.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
