Related papers: On the Guy-Kelly Conjecture for the No-Three-In-Li…
Edmonds, Lov\'asz, and Pulleyblank showed that if a matching covered graph has a nontrivial tight cut, then it also has a nontrivial ELP-cut. Carvalho et al. gave a stronger conjecture: if a matching covered graph has a nontrivial tight cut…
This is the announcement of an alternative approach to the 3-dimensional Poincar\'e Conjecture, different from Perelman's big and spectacular breakthrough. No claim concerning the other parts of the Thurston Geometrization Conjecture, come…
In the late 1990's, Bremner conjectured that long arithmetic progressions among the $x$-coordinates of rational points of an elliptic curve $E$ over $\mathbb{Q}$ should force the rank of $E$ to be large. This conjecture (and a broad…
In [Directed tree-width, J. Combin. Theory Ser. B 82 (2001), 138-154] we introduced the notion of tree-width of directed graphs and presented a conjecture, formulated during discussions with Noga Alon and Bruce Reed, stating that a digraph…
In 2008, Chen and Chv\'atal conjectured that in every finite metric space of $n$ points, there are at least $n$ distinct lines, or the whole set of points is a line. This is a generalization of a classical result in the Euclidean plane. The…
In this article we investigate the century-old continuous extension problem of the Riemann map. Let $G$ be a simply connected domain. We call $\lambda$ in $\partial G$ a multiple point if there are simply connected subdomains $ U$ and $V$…
Reay's relaxed Tverberg conjecture and Conway's thrackle conjecture are open problems about the geometry of pairwise intersections. Reay asked for the minimum number of points in Euclidean d-space that guarantees any such point set admits a…
In 1967, Erd\H{o}s and Hajnal asked the question: Does there exist a $K_4$-free graph that is not the union of two triangle-free graphs? Finding such a graph involves solving a special case of the classical Ramsey arrowing operation.…
Given a rank 3 real arrangement $\mathcal A$ of $n$ lines in the projective plane, the Dirac-Motzkin conjecture (proved by Green and Tao in 2013) states that for $n$ sufficiently large, the number of simple intersection points of $\mathcal…
We investigate limit linear series on chains of elliptic curves, giving a simple proof of a conjecture of Farkas stating the existence of curves with a theta-characteristic with a given number of sections for the expected range of genera.…
We show an example of a sequence of elliptic operators in the unit ball with drifts that diverge as the inverse distance to the boundary, for which we do not get uniform upper estimates for the Green's function with the pole at the origin.…
A wide variety of articles, starting with the famous paper (Gidas, Ni and Nirenberg in Commun. Math. Phys. 68, 209-243 (1979)) is devoted to the uniqueness question for the semilinear elliptic boundary value problem…
We give a self-contained exposition of the recent remarkable result of Kelley and Meka: if $A\subseteq \{1,\ldots,N\}$ has no non-trivial three-term arithmetic progressions then $\lvert A\rvert \leq \exp(-c(\log N)^{1/12})N$ for some…
We show that the maximum number of triples on $n$~points, if no three triples span at most five points, is $(1\pm o(1))n^2/5$. More generally, let $f^{(r)}(n;k,s)$ be the maximum number of edges of an $r$-uniform hypergraph on $n$~vertices…
Let n points be placed on a closed convex domain on the plane, no three points on a straight line. A conjecture by H. A. Heilbronn (before 1950) stated that on the convex domain of unit area the smallest triangle defined by these points has…
In trying to generalize the classic Sylvester-Gallai theorem and De Bruijn-Erd\H{o}s theorem in plane geometry, lines and closure lines were previously defined for metric spaces and hypergraphs. Both definitions do not obey the geometric…
We describe a large-scale computational experiment to study structure in the numbers of real solutions to osculating instances of Schubert problems. This investigation uncovered Schubert problems whose computed numbers of real solutions…
The Shannon lower bound has been the subject of several important contributions by Berger. This paper surveys Shannon bounds on rate-distortion problems under mean-squared error distortion with a particular emphasis on Berger's techniques.…
Based on a new idea of factorization, we prove an improved discrete Rellich inequality and discuss its optimality. We also give a conjecture on improved higher order discrete Hardy-like inequalities and formulate an open problem for the…
The square peg problem asks whether every continuous curve in the plane that starts and ends at the same point without self-intersecting contains four distinct corners of some square. Toeplitz conjectured in 1911 that this is indeed the…