351. Weakly saturated hypergraphs and a conjecture of Tuza.
- Author
-
Shapira, Asaf and Tyomkyn, Mykhaylo
- Subjects
- *
LOGICAL prediction , *HYPERGRAPHS , *COMBINATORICS - Abstract
Given a fixed hypergraph H, let \operatorname {wsat}(n,H) denote the smallest number of edges in an n-vertex hypergraph G, with the property that one can sequentially add the edges missing from G, so that whenever an edge is added, a new copy of H is created. The study of \operatorname {wsat}(n,H) was introduced by Bollobás in 1968, and turned out to be one of the most influential topics in extremal combinatorics. While for most H very little is known regarding \operatorname {wsat}(n,H), Alon proved in 1985 that for every graph H there is a limiting constant C_H so that \operatorname {wsat}(n,H)=(C_H+o(1))n. Tuza conjectured in 1992 that Alon's theorem can be (appropriately) extended to arbitrary r-uniform hypergraphs. In this paper we prove this conjecture. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF