The bunkbed conjecture is not robust to generalisation

DOI10.1016/J.EJC.2025.104188MaRDI QIDQ6957475zbMATH OpenFDO

Authors Lawrence Hollom

Publication date 16 July 2025

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2025.104188

zbMATH Keywords

bunkbed conjecturedirected graphshypergraphspercolation

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Hypergraphs (05C65) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites work

• A correlation inequality for connection events in percolation
• A new proof of the bunkbed conjecture in the \(p \uparrow 1\) limit
• Erratum to: ``On percolation and the bunkbed conjecture
• On a Conjecture of Bollobás and Brightwell Concerning Random Walks on Product Graphs
• On percolation and the bunkbed conjecture
• Self-dual planar hypergraphs and exact bond percolation thresholds
• The bunkbed conjecture holds in the limit
• The bunkbed conjecture on the complete graph

Cited in

(2)

• Bond percolation does not simulate site percolation
• The acyclic directed bunkbed conjecture is false

This page was built for publication: The bunkbed conjecture is not robust to generalisation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6957475)