Contagious sets in dense graphs

DOI10.1016/j.ejc.2017.07.011zbMath1373.05099arXiv1503.00158OpenAlexW2747174799MaRDI QIDQ1678088

Matthias Poloczek, Daniel Reichman, Daniel Freund

Publication date: 14 November 2017

Published in: Lecture Notes in Computer Science, European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.00158

zbMATH Keywords

extremal graph theorytarget set selectionbootstrap percolation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Density (toughness, etc.) (05C42)

Related Items (7)

Bootstrap percolation via automated conjecturing ⋮ Deterministic bootstrap percolation on trees ⋮ Minimum degree conditions for small percolating sets in bootstrap percolation ⋮ Whom to befriend to influence people ⋮ On the spread of influence in graphs ⋮ Evangelism in Social Networks ⋮ Large deviations for subcritical bootstrap percolation on the Erdős-Rényi graph

Cites Work

• Unnamed Item
• Unnamed Item
• The time of bootstrap percolation with dense initial sets
• Combinatorial model and bounds for target set selection
• New bounds for contagious sets
• Maximal percolation time in hypercubes under 2-bootstrap percolation
• Bootstrap percolation on the random graph \(G_{n,p}\)
• Bootstrap percolation on the hypercube
• The time of bootstrap percolation with dense initial sets for all thresholds
• Note on Hamilton Circuits
• Bootstrap percolation on the random regular graph
• On the Approximability of Influence in Social Networks
• Random disease on the square grid
• Contagious Sets in Expanders
• The sharp threshold for bootstrap percolation in all dimensions

This page was built for publication: Contagious sets in dense graphs