The Minimum Size of Saturated Hypergraphs
From MaRDI portal
Publication:4934787
DOI10.1017/S0963548399003971zbMath0938.05035MaRDI QIDQ4934787
Publication date: 30 January 2000
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items (19)
Weakly saturated hypergraphs and a conjecture of Tuza ⋮ Unnamed Item ⋮ Minimum degree and the minimum size of \(K_2^t\)-saturated graphs ⋮ On minimum saturated matrices ⋮ Saturating Sperner families ⋮ On saturated \(k\)-Sperner systems ⋮ Saturation for the 3-uniform loose 3-cycle ⋮ Linearity of saturation for Berge hypergraphs ⋮ Saturation of Ordered Graphs ⋮ The saturation number of \(K_{3,3}\) ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Saturation numbers for Berge cliques ⋮ Saturation problems in convex geometric hypergraphs ⋮ All minimum C5-saturated graphs ⋮ Hypergraph saturation irregularities ⋮ Saturation of Berge hypergraphs ⋮ A note on saturation for Berge-\(G\) hypergraphs ⋮ Minimum C5‐saturated graphs ⋮ MinimumK2, 3-Saturated Graphs
This page was built for publication: The Minimum Size of Saturated Hypergraphs