Hypergraph saturation irregularities
From MaRDI portal
Abstract: Let be a family of -graphs. An -graph is called -saturated if it does not contain any members of but adding any edge creates a copy of some -graph in . The saturation number is the minimum number of edges in an -saturated graph on vertices. We prove that there exists a finite family such that does not tend to a limit. This settles a question of Pikhurko.
Recommendations
Cites work
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 4081590 (Why is no real title available?)
- scientific article; zbMATH DE number 2192110 (Why is no real title available?)
- A survey of minimum saturated graphs
- On generalized graphs
- Saturated graphs with minimal number of edges
- The Minimum Size of Saturated Hypergraphs
Cited in
(9)- A survey of minimum saturated graphs
- Saturation of Berge hypergraphs
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Microthesis: Hypergraph saturation irregularities
- scientific article; zbMATH DE number 4081590 (Why is no real title available?)
- Hyperbolic saturation
- Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph
- scientific article; zbMATH DE number 2192110 (Why is no real title available?)
- Weakly saturated hypergraphs and a conjecture of Tuza
This page was built for publication: Hypergraph saturation irregularities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753084)