A note on the computational complexity of weak saturation
From MaRDI portal
Cites work
- An extremal problem for sets with applications to graph theory
- An extremal problem for two families of sets
- Asymptotic growth of sparse saturated structures is locally determined
- Decompositions of two-dimensional simplicial complexes
- Exact bounds for some hypergraph saturation problems
- Extremal bounds for bootstrap percolation in the hypercube
- scientific article; zbMATH DE number 3920492 (Why is no real title available?)
- scientific article; zbMATH DE number 4081590 (Why is no real title available?)
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 3749892 (Why is no real title available?)
- scientific article; zbMATH DE number 3561367 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 3275275 (Why is no real title available?)
- Hyperconnectivity of graphs
- Linear algebra and bootstrap percolation
- NP-Hardness of Computing PL Geometric Category in Dimension 2
- Random disease on the square grid
- Saturated r-uniform hypergraphs
- Shellability is NP-complete
- Solution of an extremal problem for sets using resultants of polynomials
- Uniform families and count matroids
- Weak saturation numbers for multiple copies
- Weak saturation of multipartite hypergraphs
- Weakly saturated hypergraphs and a conjecture of Tuza
- Weakly saturated hypergraphs and exterior algebra
This page was built for publication: A note on the computational complexity of weak saturation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7303680)
