






















Abstract:Given an $r$-uniform hypergraph $H$ and a positive integer $n$, the weak saturation number $\mathrm{wsat}(n,H)$ is the minimum number of edges in an $r$-uniform hypergraph $F$ on $n$ vertices such that the missing edges in $F$ can be added, one at a time, so that each added edge creates a copy of $H$. Shapira and Tyomkyn (Proceedings of the American Mathematical Society, 2023) proved Tuza's conjecture on asymptotic behaviour of $\mathrm{wsat}(n, H)$. In this paper we provide a significantly shorter proof of the conjecture.
From: Nikolai Terekhov [view email]
[v1]
Fri, 4 Apr 2025 15:39:40 UTC (4 KB)
[v2]
Thu, 24 Apr 2025 08:09:50 UTC (5 KB)
[v3]
Mon, 6 Jul 2026 12:54:29 UTC (5 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。