scientific article; zbMATH DE number 3275275

Cited in

(46)

Extremal bounds for bootstrap percolation in the hypercube
Bootstrap percolation via automated conjecturing
On \(K_{2, t}\)-bootstrap percolation
Spanoids -- an abstraction of spanning structures, and a barrier for LCCs
Counting restricted orientations of random graphs
Exact bounds for some hypergraph saturation problems
The weak saturation number of \(K_{2,t}\)
Saturation numbers of joins of graphs
Weakly saturated random graphs
Transitive closure in a polluted environment
Weakly saturated subgraphs of random graphs
Linear algebra and bootstrap percolation
Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\)
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs
The rainbow saturation number is linear
On saturated \(k\)-Sperner systems
Deterministic bootstrap percolation on trees
Size of weakly saturated graphs
Sharp thresholds for contagious sets in random graphs
Extremal bounds for bootstrap percolation in the hypercube
\(H\)-percolation with a random \(H\)
Bootstrap percolation on the random graph \(G_{n,p}\)
A sharp threshold for bootstrap percolation in a random hypergraph
Weak saturation stability
Long running times for hypergraph bootstrap percolation
Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs
Threshold for stability of weak saturation
An extremal problem for sets with applications to graph theory
Weak saturation number of a complete bipartite graph
Minimum clique-free subgraphs of Kneser graphs
Lower bounds for graph bootstrap percolation via properties of polynomials
The sharp \(K_4\)-percolation threshold on the Erdős-Rényi random graph
Weakly saturated hypergraphs and a conjecture of Tuza
Minimizing the number of edges in \(K_{(s,t)}\)-saturated bipartite graphs
\(K_{s,t}\)-saturated bipartite graphs
Geometrical solution of an intersection problem for two hypergraphs
Linearity of saturation for Berge hypergraphs
Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
\(K_{r,s}\) graph bootstrap percolation
On the maximum running time in graph bootstrap percolation
Rainbow Saturation for Complete Graphs
Graph cover-saturation
Weak saturation numbers of complete bipartite graphs in the clique
Maximal matroids in weak order posets
On the running time of hypergraph bootstrap percolation
On the number of \(K_4\)-saturating edges

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5558932)