Largest and smallest minimal percolating sets in trees
From MaRDI portal
Publication:426841
zbMATH Open1244.05062MaRDI QIDQ426841FDOQ426841
Authors: Eric Riedl 
Publication date: 12 June 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p64
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Deterministic bootstrap percolation on trees
- Minimum degree conditions for small percolating sets in bootstrap percolation
- Largest minimal percolating sets in hypercubes under 2-bootstrap percolation
- Minimal percolating sets in bootstrap percolation
- On slowly percolating sets of minimal size in bootstrap percolation
Cited In (14)
- Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation
- Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs
- Minimal percolating sets in bootstrap percolation
- Minimum degree conditions for small percolating sets in bootstrap percolation
- Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach
- Bootstrap percolation via automated conjecturing
- Maximal induced paths and minimal percolating sets in hypercubes
- The time of bootstrap percolation with dense initial sets
- Neighborhood growth dynamics on the Hamming plane
- Maximal spanning time for neighborhood growth on the Hamming plane
- Deterministic bootstrap percolation on trees
- Bootstrap Percolation on Degenerate Graphs
- Minimal spanning tree and percolation on mosaics: graph theory and percolation
- New ordering methods to construct contagious sets and induced degenerate subgraphs
This page was built for publication: Largest and smallest minimal percolating sets in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q426841)
