The Minimum Size of Saturated Hypergraphs
From MaRDI portal
Recommendations
Cited in
(29)- Asymptotic growth of sparse saturated structures is locally determined
- Hypergraph saturation irregularities
- Saturation of Berge hypergraphs
- A note on saturation for Berge-\(G\) hypergraphs
- A note on the minimum number of edges in hypergraphs with property O
- Linearity of saturation for Berge hypergraphs
- Saturation problems in convex geometric hypergraphs
- Constructing designs straightforwardly: Worst arising cases
- All minimum \(C_{5}\)-saturated graphs
- The minimum number of edges in uniform hypergraphs with property O
- Minimum C5‐saturated graphs
- On minimum saturated matrices
- Saturating Sperner families
- On saturated k-Sperner systems
- scientific article; zbMATH DE number 915258 (Why is no real title available?)
- Min-max and max-min graph saturation parameters
- scientific article; zbMATH DE number 2192110 (Why is no real title available?)
- MinimumK2, 3-Saturated Graphs
- A survey of minimum saturated graphs
- Weakly saturated hypergraphs and a conjecture of Tuza
- Constructive upper bounds for cycle-saturated graphs of minimum size
- Saturation for the 3-uniform loose 3-cycle
- 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
- The saturation number of C₆
- The asymptotic behaviour of \(sat(n, \mathcal{F})\)
- Minimum degree and the minimum size of \(K_2^t\)-saturated graphs
This page was built for publication: The Minimum Size of Saturated Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934787)
