The acyclic directed bunkbed conjecture is false
Tomasz Przyby{\l}owski
TL;DR
This paper constructs a specific acyclic directed graph that disproves the Bunkbed Conjecture, providing a counterexample that resolves previously posed conjectures.
Contribution
It presents the first counterexample to the Bunkbed Conjecture in the acyclic directed graph setting, disproving longstanding assumptions.
Findings
Counterexample disproves the conjecture
Resolves conjectures by Leander and Hollom
Shows limitations of the Bunkbed Conjecture in directed graphs
Abstract
We construct a simple acyclic directed graph for which the Bunkbed Conjecture is false, thereby resolving conjectures posed by Leander and by Hollom.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Algebraic Geometry and Number Theory · Advanced Combinatorial Mathematics