Name
Abstract | ||
|---|---|---|
Let $rge 3$ and $kge 2$ be fixed integers. Bollobas and Scott conjectured that every $r$-uniform hypergraph with $m$ edges has a vertex partition into $k$ sets with at most $m/k^r+o(m)$ edges in each set, and proved the conjecture in the case $r=3$. In this paper, we confirm this conjecture in the case $r=4$ by showing that every 4-uniform hypergraph with $m$ edges has a vertex partition into $k$ sets with at most $m/k^4+O(m^{8/9})$ edges in each set. |
Year | Venue | DocType |
|---|---|---|
2018 | SIAM J. Discrete Math. | Journal |
Volume | Issue | Citations |
32 | 1 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jianfeng Hou | 1 | 0 | 0.68 |
| Shu-Fei Wu | 2 | 0 | 0.34 |
| Qinghou Zeng | 3 | 7 | 1.57 |
| Wenxing Zhu | 4 | 0 | 2.70 |