WEAKLY SATURATED HYPERGRAPHS AND A CONJECTURE OF TUZA

Asaf Shapira; Mykhaylo Tyomkyn

doi:https://doi.org/10.1090/proc/16197

WEAKLY SATURATED HYPERGRAPHS AND A CONJECTURE OF TUZA

Asaf Shapira, Mykhaylo Tyomkyn

School of Mathematical Sciences

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

Abstract

Given a fixed hypergraph H, let 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 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 wsat(n, H), Alon proved in 1985 that for every graph H there is a limiting constant C_H so that 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.

Original language	English
Pages (from-to)	2795-2805
Number of pages	11
Journal	Proceedings of the American Mathematical Society
Volume	151
Issue number	7
DOIs	https://doi.org/10.1090/proc/16197
State	Published - 1 Jul 2023

All Science Journal Classification (ASJC) codes

Applied Mathematics
General Mathematics

Access to Document

https://doi.org/10.1090/proc/16197

Cite this

@article{4a35ef730639491e955928ccb55c65c0,

title = "WEAKLY SATURATED HYPERGRAPHS AND A CONJECTURE OF TUZA",

abstract = "Given a fixed hypergraph H, let 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 wsat(n, H) was introduced by Bollob{\'a}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 wsat(n, H), Alon proved in 1985 that for every graph H there is a limiting constant CH so that wsat(n, H) = (CH + o(1))n. Tuza conjectured in 1992 that Alon{\textquoteright}s theorem can be (appropriately) extended to arbitrary r-uniform hypergraphs. In this paper we prove this conjecture.",

author = "Asaf Shapira and Mykhaylo Tyomkyn",

note = "Publisher Copyright: {\textcopyright} 2023 American Mathematical Society.",

year = "2023",

month = jul,

day = "1",

doi = "https://doi.org/10.1090/proc/16197",

language = "الإنجليزيّة",

volume = "151",

pages = "2795--2805",

journal = "Proceedings of the American Mathematical Society",

issn = "0002-9939",

publisher = "American Mathematical Society",

number = "7",

}

TY - JOUR

T1 - WEAKLY SATURATED HYPERGRAPHS AND A CONJECTURE OF TUZA

AU - Shapira, Asaf

AU - Tyomkyn, Mykhaylo

PY - 2023/7/1

Y1 - 2023/7/1

N2 - Given a fixed hypergraph H, let 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 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 wsat(n, H), Alon proved in 1985 that for every graph H there is a limiting constant CH so that wsat(n, H) = (CH + 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.

AB - Given a fixed hypergraph H, let 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 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 wsat(n, H), Alon proved in 1985 that for every graph H there is a limiting constant CH so that wsat(n, H) = (CH + 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.

UR - http://www.scopus.com/inward/record.url?scp=85171666298&partnerID=8YFLogxK

U2 - https://doi.org/10.1090/proc/16197

DO - https://doi.org/10.1090/proc/16197

M3 - مقالة

SN - 0002-9939

VL - 151

SP - 2795

EP - 2805

JO - Proceedings of the American Mathematical Society

JF - Proceedings of the American Mathematical Society

IS - 7

ER -

WEAKLY SATURATED HYPERGRAPHS AND A CONJECTURE OF TUZA

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this