SIAM Journal on Discrete Mathematics, Volume 34, Issue 4, Page 2583-2584, January 2020.
We are indebted to Spink and Tiba Spink and Tiba [3] for pointing out that the key technical lemma (Lemma 4) is incorrect in our paper [2]. We tried to make a revision for fixing the gap. However, with the help of mathematical software Lingo, we found that our lemma has counterexamples and its conclusion is incorrect. The Bollobás--Scott conjecture Spink and Tiba [3], “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,” remains open for $r\ge4$ and seems difficult. The following result shows that Lemma 4 in [2] is wrong even in the case $k=2$.

中文翻译：

---

勘误表：4一致超图的Bollobás-Scott猜想

SIAM离散数学杂志，第34卷，第4期，第2583-2584页，2020年1月。
我们感谢Spink和Tiba Spink和Tiba [3]指出，关键的技术引理（引理4）在本文中是错误的。 [2]。我们试图进行修订以弥补差距。但是，借助数学软件Lingo，我们发现引理有反例，其结论是错误的。Bollobás-Scott猜想Spink和Tiba [3]，“每个具有$ m $边的$ r $一致超图都有一个顶点划分成$ k $个集合，最多包含$ m / k ^ r + o（m）$边缘保持开放”，对于$ r \ ge4 $仍然开放，并且似乎很困难。以下结果表明，即使在$ k = 2 $的情况下，[2]中的引理4也是错误的。