Saturation number of Berge stars in random hypergraphs
From MaRDI portal
(Redirected from Publication:2215467)
Recommendations
Cites work
- A Problem in Graph Theory
- A note on saturation for Berge-\(G\) hypergraphs
- A survey of minimum saturated graphs
- Extremal results for Berge hypergraphs
- Linearity of saturation for Berge hypergraphs
- Nearly-regular hypergraphs and saturation of Berge stars
- Ramsey numbers of Berge-hypergraphs and related structures
- Saturated graphs with minimal number of edges
- Saturation in random graphs
- Saturation of Berge hypergraphs
- Spanning structures and universality in sparse hypergraphs
- Star saturation number of random graphs
- The probabilistic method
Cited in
(7)- Nearly-regular hypergraphs and saturation of Berge stars
- Saturation of Berge hypergraphs
- A note on saturation for Berge-\(G\) hypergraphs
- On saturation of Berge hypergraphs
- Tight concentration of star saturation number in random graphs
- Saturation numbers for Berge cliques
- Star saturation number of random graphs
This page was built for publication: Saturation number of Berge stars in random hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215467)