Related papers: The Nitsche conjecture
A graph is diameter-2-critical if its diameter is 2 but the removal of any edge increases the diameter. A well-studied conjecture, known as the Murty-Simon conjecture, states that any diameter-2-critical graph of order n has at most…
In 2014, Keevash proved the existence of $(n,q,r)$-Steiner systems (equivalently $K_q^r$-decompositions of $K_n^r$) for all large enough $n$ satisfying the necessary divisibility conditions. In 2021, Glock, K\"uhn, and Osthus proposed a…
We construct a Banach space satisfying that the nearest point map (also called proximity mapping or metric projection) onto any compact and convex subset is continuous but not uniformly continuous. The space we construct is locally…
We establish a localized Bochner-type rigidity theorem for harmonic maps between Riemannian manifolds. Let $f : (M,g) \to (\overline{M},\overline{g})$ be a harmonic map from a compact manifold. Instead of assuming a global nonpositivity…
The Manin conjecture is established for Ch\^atelet surfaces over Q arising as minimal proper smooth models of the surface Y^2+Z^2=f(X) where f is a totally reducible polynomial of degree 3 without repeated roots. These surfaces do not…
Wehrl used Glauber coherent states to define a map from quantum density matrices to classical phase space densities and conjectured that for Glauber coherent states the mininimum classical entropy would occur for density matrices equal to…
Ryser's Conjecture states that any $r$-partite $r$-uniform hypergraph has a vertex cover of size at most $r - 1$ times the size of the largest matching. For $r = 2$, the conjecture is simply K\"onig's Theorem and every bipartite graph is a…
Enneper's wire, the image of the circle of radius $R$ under Enneper's surface, bounds exactly three minimal surfaces for $R$ between 1 and $\sqrt 3$, and these three surfaces depend continuously on $R$. The other two surfaces (besides…
The celebrated Erd\H{o}s-Hajnal Conjecture says that in any proper hereditary class of finite graphs we are guaranteed to have a clique or anti-clique of size $n^c$, which is a much better bound than the logarithmic size that is provided by…
It is one of the main properties of uniformly hyperbolic dynamics that points of two distinct trajectories cannot be uniformly close one to another. This characteristics of hyperbolic dynamics is called expansivity. Hirsch, Pugh and Shub,…
A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…
In this paper we study the moduli space of properly Alexandrov-embedded, minimal annuli in $\mathbb{H}^2 \times \mathbb{R}$ with horizontal ends. We say that the ends are horizontal when they are graphs of $\mathcal{C}^{2, \alpha}$…
We prove that the space of smooth Riemannian metrics on the three-ball with non-negative Ricci curvature and strictly convex boundary is path connected; and, moreover, that the associated moduli space (i.e., modulo orientation-preserving…
We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of deriving lower bounds for consensus protocols and by the so-called "definitive…
We prove that every smooth compact submanifold of $\R^n$ can be approximated up to a small isotopy by the real locus of a nonsingular complex algebraic subset of $\C^n$ defined over $\R$. This settles a version of a conjecture posed in 1952…
In this paper, we prove the existence of $H^2$-regular coordinates on Riemannian $3$-manifolds with boundary, assuming only $L^2$-bounds on the Ricci curvature, $L^4$-bounds on the second fundamental form of the boundary, and a positive…
A well-known conjecture, often attributed to Ryser, states that the cover number of an $r$-partite $r$-uniform hypergraph is at most $r - 1$ times larger than its matching number. Despite considerable effort, particularly in the…
The fundamental gap conjecture proved by Andrews and Clutterbuck in 2011 provides the sharp lower bound for the difference between the first two Dirichlet Laplacian eigenvalues in terms of the diameter of a convex set in $\mathbb{R}^N$. The…
Erd\"os proved in 1946 that if a set $E\subset\mathbb{R}^n$ is closed and non-empty, then the set, called ambiguous locus or medial axis, of points in $\mathbb{R}^n$ with the property that the nearest point in $E$ is not unique, can be…
Erd\H{o}s and Rothschild asked to estimate the maximum number, denoted by H(N,C), such that every N-vertex graph with at least CN^2 edges, each of which is contained in at least one triangle, must contain an edge that is in at least H(N,C)…