Related papers: The bunkbed conjecture is false
We refute the Probabilistic Universal Graph Conjecture of Harms, Wild, and Zamaraev, which states that a hereditary graph property admits a constant-size probabilistic universal graph if and only if it is stable and has at most factorial…
In this article, we give a positive answer to the cycle double cover conjecture. Ones who are mainly interesting in the proof of the conjecture can only read Sections 2 and 4.
In this article, we give a proof on the Arnold-Chekanov Lagrangian intersection conjecture on the cotangent bundles and its generalizations.
We show that the uniform Littlewood Conjecture (ULC) recently introduced by Bandi, Fregoli and Kleinbock is false. More precisely the counterexamples form a residual set, the method further suggests positive Hausdorff dimension. For a…
We give a new proof of the Weyl-von Neumann-Berg theorem. Our proof improves Halmos' proof in 1972 by observing the fact that every compact set in the complex plane is the continuous image of a compact set in the real line.
The cycle double cover conjecture states that a graph is bridge-free if and only if there is a family of edge-simple cycles such that each edge is contained in exactly two of them. It was formulated independently by Szekeres (1973) and…
Firstly, we propose our conjectured Reverse-log-Brunn-Minkowski inequality (RLBM). Secondly, we show that the (RLBM) conjecture is equivalent to the log-Brunn-Minkowski (LBM) conjecture proposed by B\"or\"oczky-Lutwak-Yang-Zhang. We name…
Battle, Harary, and Kodama (1962) and independently Tutte (1963) proved that the complete graph with nine vertices is not biplanar. Aiming towards simplicity and brevity, in this note we provide a short proof of this claim.
The Neggers-Stanley conjecture (also known as the Poset conjecture) asserts that the polynomial counting the linear extensions of a partially ordered set on $\{1,2,...,p\}$ by their number of descents has real zeros only. We provide…
Paper withdrawn by the author.
O. H. Keller conjectured in 1930 that in any tiling of $\Bbb R^n$ by unit $n$-cubes there exist two of them having a complete facet in common. O. Perron proved this conjecture for $n\le 6$. We show that for all $n\ge 10$ there exists a…
Consider the graph that has as vertices all bitstrings of length $2n+1$ with exactly $n$ or $n+1$ entries equal to 1, and an edge between any two bitstrings that differ in exactly one bit. The well-known middle levels conjecture asserts…
We show that a graph $G$ has a normal spanning tree if and only if its vertex set is the union of countably many sets each separated from any subdivided infinite clique in $G$ by a finite set of vertices. This proves a conjecture by Brochet…
We show that, under some technical conditions, the Strong Slope Conjecture proposed by Kalfagianni and Tran is closed under connect sums and cabling. As an application, we establish the Strong Slope Conjecture for graph knots.
In this short note we present a simple counterexample to a nonlinear version of the Krein-Rutman theorem reported in [Nonlinear Anal. 11 (2007), 3084-3090]. Correct versions of this theorem, and related results for superadditive maps are…
A linear mapping upon real n-dimensional space, where the dimension n is odd, has a real eigenvalue-eigenvector pair. The corresponding statement for complex vector spaces holds true for any dimension n, but should be easy to demonstrate…
The toral rank conjecture speculates that the sum of the Betti numbers of a compact manifold admitting a free action of a torus of rank $r$ is bounded from below by $2^r$. Clearly, such an action yields a torus bundle, and, more generally,…
In his 1979 paper Trotman proves, using the techniques of the Thom transversality theorem, that under some conditions on the dimensions of the manifolds under consideration, openness of the set of maps transverse to a stratification in the…
In this paper, we give a simple counter example to the famous Hodge conjecture.
New obstructions for embedding one compact oriented 3-manifold in another are given. A theorem of D. Krebes concerning 4-tangles embedded in links arises as a special case. Algebraic and skein-theoretic generalizations for 2n-tangles…