相关论文: The bunkbed conjecture remains true when gluing al…

We conjecture that every $n$-vertex graph of minimum degree at least $\frac k2$ and maximum degree at least $2k$ contains all trees with $k$ edges as subgraphs. We prove an approximate version of this conjecture for trees of bounded degree…

A bipartite graph $G=(A, B, E)$ is said to be a biconvex bipartite graph if there exist orderings $<_A$ in $A$ and $<_B$ in $B$ such that the neighbors of every vertex in $A$ are consecutive with respect to $<_B$ and the neighbors of every…

It has recently been shown that any simple (i.e. nonintersecting) polygonal chain in the plane can be reconfigured to lie on a straight line, and any simple polygon can be reconfigured to be convex. This result cannot be extended to tree…

We propose a new method, using deformation theory, to study the maximal rank conjecture. For line bundles of extremal degree, which can be viewed as the first case to test the conjecture, we prove that maximal rank conjecture holds by our…

The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…

We study the AJ conjecture for $(r,2)$-cables of a knot, where $r$ is an odd integer. Using skein theory, we show that the AJ conjecture holds true for most $(r,2)$-cables of some classes of two-bridge knots and pretzel knots.

The conjectures of Manin and Peyre are confirmed for a certain threefold.

Assume that the section conjecture holds over number fields. We prove then that it holds for a broad class of curves defined over finitely generated extensions of $\mathbb{Q}$. This class contains every projective, hyperelliptic curve,…

In 1951, Bang posed the affine plank conjecture, which remains open: If a convex body in $\mathbb{R}^d$ is covered by planks, then the total relative width of the planks is at least one. We prove a lower bound of $2/(1+\sqrt{d})$ for this…

In this paper, we prove the Geometric Arveson-Douglas Conjecture for a special case which allow some singularity on $\partial{\mathbb{B}_n}$. More precisely, we show that if a variety can be decomposed into two varieties, each having nice…

We establish the exact overlaps conjecture for iterated functions systems on the real line with algebraic contractions and arbitrary translations.

In this article, we give a proof on the Arnold-Chekanov Lagrangian intersection conjecture on the cotangent bundles and its generalizations.

In this paper we study the positivity of the cotangent bundle of projective manifolds. We conjecture that the cotangent bundle is pseudoeffective if and only the manifold has non-zero symmetric differentials. We confirm this conjecture for…

We propose a formulation of the relative Bogomolov conjecture and show that it gives an affirmative answer to a question of Mazur's concerning the uniformity of the Mordell-Lang conjecture for curves. In particular we show that the relative…

The class of cographs is one of the most well-known graph classes, which is also known to be equivalent to the class of $P_4$-free graphs. We show that Mader's conjecture is true if we restrict ourselves to cographs, that is, for any tree…

Akbulut and Kirby conjectured that two knots with the same $0$-surgery are concordant. In this paper, we prove that if the slice-ribbon conjecture is true, then the modified Akbulut-Kirby's conjecture is false. We also give a fibered…

A conic bundle is a contraction $X\to Z$ between normal varieties of relative dimension $1$ such that $-K_X$ is relatively ample. We prove a conjecture of Shokurov which predicts that, if $X\to Z$ is a conic bundle such that $X$ has…

We prove a logical implication between two old conjectures stated by Bapat and Sunder about the permanent of positive semidefinite matrices. Although Drury has recently disproved both conjectures, this logical implication yields a…

We consider two conjectures made in regard to the graph grabbing game, played on a vertex weighted graph. Seacrest and Seacrest conjectured in 2012 that the first player can win the graph grabbing game on any even-order bipartite graph. Eoh…

We prove that the lonely runner conjecture holds for eight runners. Our proof relies on a computer verification and on recent results that allow bounding the size of a minimal counterexample. We note that our approach also applies to the…