Asymptotic growth of sparse saturated structures is locally determined
From MaRDI portal
(Redirected from Publication:1201274)
Let \(F\) be an \(r\)-uniform hypergraph without multiple edges. Let \[ d(F)=\min_{f\in F}\left\{\max_{e\in F,e\neq f}\{| e\cap f|\}\right\} \] be the local density of \(F\). It is shown that \(d(F)\) determines the growth of \(\text{wsat}(n,F)\) --- the minimum number of edges in a weakly \(F\)-saturated hypergraph on \(n\) vertices. Another value --- local sparseness --- determines the growth \(\text{ssat}(n,F)\) for strongly \(F\)-saturated hypergraphs.
Recommendations
Cites work
- A Problem in Graph Theory
- An extremal problem for sets with applications to graph theory
- Asymptotic results on saturated graphs
- scientific article; zbMATH DE number 4081590 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 4185643 (Why is no real title available?)
- On generalized graphs
- Saturated r-uniform hypergraphs
- Saturated graphs with minimal number of edges
Cited in
(13)- On saturation of Berge hypergraphs
- Weak saturation numbers of complete bipartite graphs in the clique
- Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
- Graph cover-saturation
- Partite saturation problems
- Saturation in the hypercube and bootstrap percolation
- Weakly saturated hypergraphs and a conjecture of Tuza
- Weak saturation stability
- Weak saturation number of a complete bipartite graph
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Weak rainbow saturation numbers of graphs
- Weak saturation in graphs: a combinatorial approach
- A short proof of Tuza's conjecture for weak saturation in hypergraphs
This page was built for publication: Asymptotic growth of sparse saturated structures is locally determined
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201274)
