Saturation number of Berge stars in random hypergraphs
DOI10.37236/9302zbMATH Open1454.05080OpenAlexW3110736903MaRDI QIDQ2215467FDOQ2215467
Authors: Lele Liu, Changxiang He, Liying Kang 
Publication date: 13 December 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/9302
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Hypergraphs (05C65)
Cites Work
- Saturated graphs with minimal number of edges
- A survey of minimum saturated graphs
- The probabilistic method
- A Problem in Graph Theory
- Spanning structures and universality in sparse hypergraphs
- Extremal results for Berge hypergraphs
- Ramsey numbers of Berge-hypergraphs and related structures
- Star saturation number of random graphs
- Saturation in random graphs
- Saturation of Berge hypergraphs
- A note on saturation for Berge-\(G\) hypergraphs
- Linearity of saturation for Berge hypergraphs
- Nearly-regular hypergraphs and saturation of Berge stars
Cited In (7)
- 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
- Nearly-regular hypergraphs and saturation of Berge stars
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)
