Name
Abstract | ||
|---|---|---|
An ordered r-graph is an r-uniform hypergraph whose vertex set is linearly ordered. Given 2≤k≤r, an ordered r-graph H is interval k-partite if there exist at least k disjoint intervals in the ordering such that every edge of H has nonempty intersection with each of the intervals and is contained in their union. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.jcta.2020.105300 | Journal of Combinatorial Theory, Series A |
Keywords | DocType | Volume |
Turán problem,Ordered hypergraphs,Interval k-partite hypergraphs | Journal | 177 |
ISSN | Citations | PageRank |
0097-3165 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zoltán Füredi | 1 | 1237 | 233.60 |
| Tao Jiang | 2 | 63 | 8.69 |
| Alexandr V. Kostochka | 3 | 682 | 89.87 |
| Dhruv Mubayi | 4 | 579 | 73.95 |
| Jacques Verstraëte | 5 | 192 | 26.99 |