Related papers: The bunkbed conjecture is false

In this paper, we present a minimal counterexample to a conjecture of Perles that answers a question of Haase and Ziegler. The example is a simple 4-polytope that has an induced 3-connected 3-regular subgraph, whose graph complement is…

The paper presents a counterexample to the Hodge conjecture.

We give counterexamples to the Brown-Colbourn conjecture on reliability polynomials, in both its univariate and multivariate forms. The multivariate Brown-Colbourn conjecture is false already for the complete graph K_4. The univariate…

In 1984, Winkler conjectured that every simple Venn diagram with $n$ curves can be extended to a simple Venn diagram with $n+1$ curves. His conjecture is equivalent to the statement that the dual graph of any simple Venn diagram has a…

Let $F^{2,m}$ denote the Fock-Sobolev space of complex plane. The purpose of this paper is to study the conjecture which was shown to be false for Fock space by Ma-Yan-Zheng-Zhu in 2019. For the certain symbol space, the main result of the…

In the concluding remarks of their 1993 published and now famous paper, Jeff Kahn and Gil Kalai wrote in particular: "Our construction shows that Borsuk's conjecture is false for d = 1,325 and for every d > 2,014." But, as Bernulf Weiszbach…

We give a counterexample to a recently conjectured variant of the Penrose inequality.

Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. We disprove this conjecture.

Using the method of Coand\u{a} and Trautmann (2006), we give a simple proof of the following theorem due to Tyurin (1976) in the smooth case: if a vector bundle $E$ on a $c$-codimensional locally Cohen-Macaulay closed subscheme $X$ of the…

In 2013 Andriy V. Bondarenko showed how to construct a two-distance counterexample to Borsuk's conjecture from any strongly regular graph whose vertex set is not the union of at most $f+1$ cliques (sets of pairwise adjacent vertices) where…

In 1972, Kainen proved a general lower bound on the crossing number of a graph in a closed surface and conjectured that this bound is tight when the graph is either a complete graph or a complete bipartite graph, and the surface is of genus…

Recently, F. Brenti put a preprint on the arXiv with several interesting open problems on Coxeter groups and unimodality. In this note, we refute one of these conjectures with a counterexample and provide supporting data related to it. This…

The following conjecture was proposed in 2010 by S. Lando. Let M and N be two unions of the same number of disjoint circles in a sphere. Then there exist two spheres in 3-space whose intersection is transversal and is a union of disjoint…

The bounded orbit conjecture says that every homeomorphism on the plane with each of its orbits being bounded must have a fixed point. Brouwer's translation theorem asserts that the conjecture is true for orientation preserving…

In 1988 Fellows conjectured that if a finite, connected graph admits a finite planar emulator, then it admits a finite planar cover. We construct a finite planar emulator for K_{4,5} - 4K_2. Archdeacon showed that K_{4,5} - 4K_2 does not…

We prove the Strengthened Hanna Neumann Conjecture. We give a more direct cohomological interpretation of the conjecture in terms of "typical" covering maps, and use graph Galois theory to "symmetrize" the conjecture. The conjecture is then…

We prove Stanley's plethysm conjecture for the $2 \times n$ case, which composed with the work of Black and List provides another proof of Foulkes conjecture for the $2 \times n$ case. We also show that the way Stanley formulated his…

We show Kantor's conjecture (1974) holds in rank 4. This proves both the sticky matroid conjecture of Poljak and Turzik (1982) and the whole Kantor's conjecture, due to an argument of Bachem, Kern, and Bonin, and an equivalence argument of…

It was shown by Bishop that if Thurston's $K = 2$ conjecture holds for some planar domain, then Brennan's conjecture holds for the Riemann map of that domain as well. In this paper we show numerically that the original counterexample to…

The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…