Line Percolation in Finite Projective Planes

DOI10.1137/16M1087709zbMath1430.60083arXiv1608.00531MaRDI QIDQ4637326

Gábor Mészáros, Balázs Patkós, Dániel Gerbner, Máté Vizer, Balázs Keszegh

Publication date: 18 April 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graph theoryprojective geometryline percolation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• On the maximum running time in graph bootstrap percolation
• Bootstrap percolation in living neural networks
• Growth rates and explosions in sandpiles
• Bootstrap percolation on the Hamming torus
• Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs
• Random Graphs and Complex Networks
• Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
• Line percolation
• Noisy Contagion Without Mutation
• Finite Geometry and Combinatorial Applications
• The time of graph bootstrap percolation
• The sharp threshold for bootstrap percolation in all dimensions

This page was built for publication: Line Percolation in Finite Projective Planes