Name
Abstract | ||
|---|---|---|
A k-path is a hypergraph Pk={e1,e2,…,ek} such that |ei∩ej|=1 if |j−i|=1 and ei∩ej=∅ otherwise. A k-cycle is a hypergraph Ck={e1,e2,…,ek} obtained from a (k−1)-path {e1,e2,…,ek−1} by adding an edge ek that shares one vertex with e1, another vertex with ek−1 and is disjoint from the other edges. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.jcta.2014.09.005 | Journal of Combinatorial Theory, Series A |
Keywords | DocType | Volume |
Hypergraph Turán number,Paths,Cycles,Uniform hypergraphs | Journal | 129 |
Issue | ISSN | Citations |
C | 0097-3165 | 1 |
PageRank | References | Authors |
0.40 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexandr V. Kostochka | 1 | 682 | 89.87 |
| Dhruv Mubayi | 2 | 579 | 73.95 |
| Jacques Verstraëte | 3 | 192 | 26.99 |