Related papers: The bunkbed conjecture is false
We construct a simple acyclic directed graph for which the Bunkbed Conjecture is false, thereby resolving conjectures posed by Leander and by Hollom.
Let $G=(V,E)$ be a countable graph. The Bunkbed graph of $G$ is the product graph $G \times K_2$, which has vertex set $V\times \{0,1\}$ with "horizontal'' edges inherited from $G$ and additional "vertical'' edges connecting $(w,0)$ and…
The bunkbed conjecture was first posed by Kasteleyn. If $G=(V,E)$ is a finite graph and $H$ some subset of $V$, then the bunkbed of the pair $(G,H)$ is the graph $G\times\{1,2\}$ plus $|H|$ extra edges to connect for every $v\in H$ the…
For a finite simple graph $G$, the bunkbed graph $G^\pm$ is defined to be the product graph $G\square K_2$. We will label the two copies of a vertex $v\in V(G)$ as $v_-$ and $v_+$. The bunkbed conjecture, posed by Kasteleyn, states that for…
The well known bunkbed conjecture about percolation on finite graphs is now resolved; Gladkov, Pak and Zimin, building upon work of Hollom, have constructed a counterexample. We revisit this conjecture and study it in the broader context of…
The bunkbed conjecture, which has featured in the folklore of probability theory since at least 1985, concerns bond percolation on the product graph $G\Box K_2$. We have two copies $G_0$ and $G_1$ of $G$, and if $x^{(0)}$ and $x^{(1)}$ are…
We show that the bunkbed conjecture remains true when gluing along a vertex. As immediate corollaries, we obtain that the bunkbed conjecture is true for forests and that a minimal counterexample to the bunkbed conjecture is 2-connected.
The bunkbed of a graph $G$ is the graph $G\times\left\{ 0,1\right\} $. It has been conjectured that in the independent bond percolation model, the probability for $\left(u,0\right)$ to be connected with $\left(v,0\right)$ is greater than…
A conjecture of Woods from 1972 is disproved.
The bunkbed of a graph $G$ is the graph $G\times K_2 $. It has been conjectured that in the independent bond percolation model, the probability for $\left(u,0\right)$ to be connected with $\left(v,0\right)$ is greater than the probability…
Recently, the bunkbed conjecture has been shown to be false, which naturally prompts questions on how to classify the graphs that still satisfy the conjecture. We distinguish between a weak version of the bunkbed conjecture where all the…
We study a problem on edge percolation on product graphs $G\times K_2$. Here $G$ is any finite graph and $K_2$ consists of two vertices $\{0,1\}$ connected by an edge. Every edge in $G\times K_2$ is present with probability $p$ independent…
The article provides a counterexample to a conjecture by Blocki-Zwonek.
Let $G = (V,E)$ be a simple finite graph. The corresponding bunkbed graph $G^\pm$ consists of two copies $G^+ = (V^+,E^+),G^- = (V^-,E^-)$ of $G$ and additional edges connecting any two vertices $v_+ \in V_+,v_- \in V_-$ that are the copies…
Two conjectures recently proposed by one of the authors are disproved
In this note, we show that a "Toy Conjecture" made by (Boyle, Ishai, Pass, Wootters, 2017) is false, and propose a new one. Our attack does not falsify the full ("non-toy") conjecture in that work, and it is our hope that this note will…
Corollary 2.3 in our paper "A geometric proof of the Karpelevich-Mostow theorem", Bull. Lond. Math. Soc. 41 (2009), no. 4, 634-638, is false. Here we give a counterexample and show how to avoid the use of this corollary to give a simpler…
In 1975 Stein conjectured that in every $n\times n$ array filled with the numbers $1, \dots, n$ with every number occuring exactly $n$ times, there is a partial transversal of size $n-1$. In this note we show that this conjecture is false…
We construct a universal phantom subcategory on the blow-up of the complex projective plane in 11 general points. This phantom subcategory is the orthogonal complement of a non-full exceptional collection of line bundles of maximal length.…
We provide a proof and a counterexample to two conjectures made by N. Kuznetsov.