scientific article; zbMATH DE number 3275275
From MaRDI portal
Publication:5558932
zbMATH Open0172.48905MaRDI QIDQ5558932FDOQ5558932
Authors: Béla Bollobás 
Publication date: 1968
Title of this publication is not available (Why is that?)
Cited In (46)
- The weak saturation number of \(K_{2,t}\)
- Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs
- Extremal bounds for bootstrap percolation in the hypercube
- Exact bounds for some hypergraph saturation problems
- Counting restricted orientations of random graphs
- On saturated \(k\)-Sperner systems
- Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs
- Graph cover-saturation
- Size of weakly saturated graphs
- Linear algebra and bootstrap percolation
- Weak saturation numbers of complete bipartite graphs in the clique
- Linearity of saturation for Berge hypergraphs
- On \(K_{2, t}\)-bootstrap percolation
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Bootstrap percolation via automated conjecturing
- An extremal problem for sets with applications to graph theory
- Spanoids -- an abstraction of spanning structures, and a barrier for LCCs
- Long running times for hypergraph bootstrap percolation
- On the running time of hypergraph bootstrap percolation
- Saturation numbers of joins of graphs
- Weakly saturated random graphs
- \(H\)-percolation with a random \(H\)
- Sharp thresholds for contagious sets in random graphs
- Weak saturation stability
- On the number of \(K_4\)-saturating edges
- Maximal matroids in weak order posets
- \(K_{r,s}\) graph bootstrap percolation
- Bootstrap percolation on the random graph \(G_{n,p}\)
- Transitive closure in a polluted environment
- Deterministic bootstrap percolation on trees
- Lower bounds for graph bootstrap percolation via properties of polynomials
- \(K_{s,t}\)-saturated bipartite graphs
- The rainbow saturation number is linear
- 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
- Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\)
- Weak saturation number of a complete bipartite graph
- Geometrical solution of an intersection problem for two hypergraphs
- Weakly saturated hypergraphs and a conjecture of Tuza
- Threshold for stability of weak saturation
- Minimum clique-free subgraphs of Kneser graphs
- Extremal bounds for bootstrap percolation in the hypercube
- A sharp threshold for bootstrap percolation in a random hypergraph
- Weakly saturated subgraphs of random graphs
- Rainbow Saturation for Complete Graphs
- On the maximum running time in graph bootstrap percolation
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)
