scientific article; zbMATH DE number 3275275
From MaRDI portal
Publication:5558932
zbMath0172.48905MaRDI QIDQ5558932
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Bootstrap percolation via automated conjecturing ⋮ \(K_{r,s}\) graph bootstrap percolation ⋮ Weakly saturated hypergraphs and a conjecture of Tuza ⋮ Deterministic bootstrap percolation on trees ⋮ Sharp thresholds for contagious sets in random graphs ⋮ Lower bounds for graph bootstrap percolation via properties of polynomials ⋮ Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\) ⋮ Size of weakly saturated graphs ⋮ Long running times for hypergraph bootstrap percolation ⋮ On saturated \(k\)-Sperner systems ⋮ Weak saturation stability ⋮ Linearity of saturation for Berge hypergraphs ⋮ Transitive closure in a polluted environment ⋮ On the running time of hypergraph bootstrap percolation ⋮ Weak saturation number of a complete bipartite graph ⋮ Weakly saturated subgraphs of random graphs ⋮ Rainbow Saturation for Complete Graphs ⋮ Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Linear algebra and bootstrap percolation ⋮ Maximal matroids in weak order posets ⋮ Counting restricted orientations of random graphs ⋮ On the number of \(K_4\)-saturating edges ⋮ Weak saturation numbers of complete bipartite graphs in the clique ⋮ Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs ⋮ \(K_{s,t}\)-saturated bipartite graphs ⋮ Minimum clique-free subgraphs of Kneser graphs ⋮ Bootstrap percolation on the random graph \(G_{n,p}\) ⋮ On the maximum running time in graph bootstrap percolation ⋮ Exact bounds for some hypergraph saturation problems ⋮ Extremal bounds for bootstrap percolation in the hypercube ⋮ A sharp threshold for bootstrap percolation in a random hypergraph ⋮ On \(K_{2, t}\)-bootstrap percolation ⋮ Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs ⋮ The sharp \(K_4\)-percolation threshold on the Erdős-Rényi random graph ⋮ Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs ⋮ Extremal bounds for bootstrap percolation in the hypercube ⋮ Graph cover-saturation ⋮ Geometrical solution of an intersection problem for two hypergraphs ⋮ An extremal problem for sets with applications to graph theory
