Saturation numbers for Berge cliques

DOI10.1016/J.EJC.2023.103911arXiv2301.02973MaRDI QIDQ6201892

Mina Nahvi, Jürgen Kritschgau, Sean English, Elizabeth Sprangel

Publication date: 26 March 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.02973

zbMATH Keywords

Berge-\(F\)-saturated \(k\)-uniform hypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Saturation of Berge hypergraphs
• A note on saturation for Berge-\(G\) hypergraphs
• On saturation of Berge hypergraphs
• Saturation number of Berge stars in random hypergraphs
• Linearity of saturation for Berge hypergraphs
• Saturated graphs with minimal number of edges
• The Minimum Size of Saturated Hypergraphs
• Nearly-Regular Hypergraphs and Saturation of Berge Stars
• A Problem in Graph Theory
• Extremal Results for Berge Hypergraphs
• On generalized graphs

This page was built for publication: Saturation numbers for Berge cliques