Weak saturation stability
From MaRDI portal
Publication:6080367
DOI10.1016/j.ejc.2023.103777zbMath1522.05211arXiv2107.11138OpenAlexW3184378663MaRDI QIDQ6080367
No author found.
Publication date: 2 October 2023
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.11138
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Combinatorial probability (60C05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear algebra and bootstrap percolation
- Weak saturation numbers for multiple copies
- An extremal problem for sets with applications to graph theory
- Hyperconnectivity of graphs
- Saturated \(r\)-uniform hypergraphs
- Spanning subgraphs of random graphs
- Asymptotic growth of sparse saturated structures is locally determined
- Threshold functions for extension statements
- Weak saturation numbers of complete bipartite graphs in the clique
- Exact bounds for some hypergraph saturation problems
- Counting extensions
- Factors in random graphs
- Random disease on the square grid
- Saturation in random graphs
- Extremal bounds for bootstrap percolation in the hypercube
This page was built for publication: Weak saturation stability