Related papers: The bunkbed conjecture remains true when gluing al…

Whitehead aspherical conjecture says that every connected subcomplex of every aspherical 2-complex is aspherical. By an argument on ribbon sphere-links, it is confirmed that the conjecture is true for every contractible finite 2-complex. In…

We study simple superfaithful and superconnected quandles and we found counterexamples to a conjecture suggested by computational data. We provide also examples of superconnected quandles built using group theoretical results and…

Luo, Tian and Wu conjectured in 2022 that for any tree $T$ with bipartition $X$ and $Y$, every $k$-connected bipartite graph $G$ with $\delta(G) \geq k + t$, where $t = \max\{|X|,|Y |\}$, contains a subtree $T' \cong T$ such that $G-V(T')$…

We study the reconfiguration of plane spanning trees on point sets in the plane in convex position, where a reconfiguration step (flip) replaces one edge with another, yielding again a plane spanning tree. The flip distance between two…

In this article, we give proofs on the Arnold Lagrangian intersection conjecture on the cotangent bundles, Arnold-Givental Lagrangian intersection conjecture and the Arnold fixed point conjecture.

Luo, Tian and Wu (2022) conjectured that for any tree $T$ with bipartition $X$ and $Y$, every $k$-connected bipartite graph $G$ with minimum degree at least $k+t$, where $t=$max$\{|X|,|Y|\}$, contains a tree $T'\cong T$ such that $G-V(T')$…

This paper studies the associativity of gluing of trajectories in Morse theory. We show that the associativity of gluing follows from of the existence of compatible manifold with face structures on the compactified moduli spaces. Using our…

We show that the Jacobian conjecture of the two dimensional case is true.

We prove the $p$-curvature conjecture for rank two vector bundles with connection on generic curves, by combining deformation techniques for families of varieties and topological arguments.

We prove the meridional rank conjecture for arborescent links associated to plane trees with the following property: all branching points carry a straight branch to at least three leaves. The proof involves an upper bound on the bridge…

We give a counterexample to a conjecture of Poon [Poo06] that any orthogonal tree in two dimensions can always be flattened by a continuous motion that preserves edge lengths and avoids self-intersection. We show our example is locked by…

Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…

The Fuglede conjecture states that a set is spectral if and only if it tiles by translation. The conjecture was disproved by T. Tao for dimensions 5 and higher by giving a counterexample in $\mathbb{Z}_3^5$. We present a computer program…

We show that Generic Green's conjecture holds for generic binary curves, through a detailed analysis of the family of scrolls containing fixed rational normal curves.

Reed Conjecture is open for more than 20 years now. Here we prove that Reed Conjecture is valid for (1) {P4UnionK1, Kite}-free graphs (2) {Chair, Kite}-free graphs (3) {K2UnionK2complement , H}-free graphs and (4) {2K2, M}-free graphs where…

In this note we prove a more general (and topological) version of Gr\"unbaum's conjecture about affine invariant points. As an application of our result we show that, if we consider the action of the group of similarities, Gr\"unbaum's…

Here we prove that Reed Conjecture is valid for {P5, Flag_Complement}-free graphs where FlagComplement is the complement of the Flag graph. Some of the known results follow as corollaries to our result. Reed conjecture is still open in…

The evenness conjecture for the equivariant unitary bordism groups states that these bordism groups are free modules over the unitary bordism ring on even-dimensional generators. In this paper we review the cases in which the conjecture is…

In the famous network creation game of Fabrikant et al. a set of agents play a game to build a connected graph. The $n$ agents form the vertex set $V$ of the graph and each vertex $v\in V$ buys a set $E_v$ of edges inducing a graph…

We prove the boundedness of complements modulo two conjectures: Borisov-Alexeev conjecture and effective adjunction for fibre spaces. We discuss the last conjecture and prove it in two particular cases.