Exact bounds for some hypergraph saturation problems

DOI10.1016/j.jctb.2014.08.004zbMath1307.05167arXiv1209.3598OpenAlexW2073328888MaRDI QIDQ2259864

Asaf Shapira, Guy Moshkovitz

Publication date: 5 March 2015

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphssaturatedextremal problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items

\(K_{r,s}\) graph bootstrap percolation, Weakly saturated hypergraphs and a conjecture of Tuza, Long running times for hypergraph bootstrap percolation, Unnamed Item, Weak saturation stability, On the running time of hypergraph bootstrap percolation, Maximal matroids in weak order posets, Saturation Numbers in Tripartite Graphs, Weak saturation numbers of complete bipartite graphs in the clique, \(K_{s,t}\)-saturated bipartite graphs, Minimum clique-free subgraphs of Kneser graphs, Extremal bounds for bootstrap percolation in the hypercube, Partite Saturation of Complete Graphs, A generalization of the Bollobás set pairs inequality, A sharp threshold for bootstrap percolation in a random hypergraph, Covering graphs by monochromatic trees and Helly-type results for hypergraphs, Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs, Extremal bounds for bootstrap percolation in the hypercube, Graph cover-saturation

Cites Work

• Linear algebra and bootstrap percolation
• Solution of an extremal problem for sets using resultants of polynomials
• An extremal problem for sets with applications to graph theory
• An extremal problem for two families of sets
• A Problem in Graph Theory
• On generalized graphs
• On a Conjecture of Erdos, Hajnal and Moon
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item