Name
Abstract | ||
|---|---|---|
Let B-i((k)) be the k-uniform hypergraph whose vertex set is of the form S boolean OR T, where vertical bar S vertical bar = i, vertical bar T vertical bar = k - 1, and S boolean AND T = circle divide, and whose edges are the k-subsets of S boolean OR T that contain either S or T. We derive upper and lower bounds for the Turan density of B-i((k)) that are close to each other as k -> infinity. We also obtain asymptotically tight bounds for the Turan density of several other infinite families of hypergraphs. The constructions that imply the lower bounds are derived from elementary number theory by probabilistic arguments, and the upper bounds follow from some results of de Caen, Sidorenko, and Keevash. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1137/120889009 | SIAM JOURNAL ON DISCRETE MATHEMATICS |
Keywords | DocType | Volume |
Turan density,extremal problem,hypergraph | Journal | 26 |
Issue | ISSN | Citations |
4 | 0895-4801 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| József Balogh | 1 | 862 | 89.91 |
| Tom Bohman | 2 | 250 | 33.01 |
| Béla Bollobás | 3 | 2696 | 474.16 |
| Yi Zhao | 4 | 40 | 6.92 |