The simple-digraph counterexample conjecture for the fully directed bunkbed model
The simple-digraph counterexample conjecture for the fully directed bunkbed model
Let be a simple digraph. Construct by adding both directed vertical edges and for every , and let select a subset of the edges uniformly at random. Simple-digraph counterexample conjecture. There exists a simple digraph for which the bunkbed inequality fails:
This conjecture asks whether the counterexample can be made fully directed and simple rather than using multiple edges and undirected vertical edges; the supplied text gives no resolution.
Sources & referencesView supporting material
Primary source
Lawrence Hollom, “The bunkbed conjecture is not robust to generalisation”, arXiv:2406.01790 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.