Related papers: A Continuum Erd\H{o}s-Beck Theorem

We present a method to obtain sets of vectors proving the Bell-Kochen-Specker theorem in dimension $n$ from a similar set in dimension $d$ ($3\leq d<n\leq 2d$). As an application of the method we find the smallest proofs known in dimension…

Let $ES_{\ell}(n)$ be the minimum $N$ such that every $N$-element point set in the plane contains either $\ell$ collinear members or $n$ points in convex position. We prove that there is a constant $C>0$ such that, for each $\ell, n \ge 3$,…

A compact set $E\subset {\Bbb R}^d$ is said to be arithmetically thick if there exists a positive integer $n$ so that the $n$-fold arithmetic sum of $E$ has non-empty interior. We prove the arithmetic thickness of $E$, if $E$ is uniformly…

$\renewcommand{\Re}{{\rm I\!\hspace{-0.025em} R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\eps}{\varepsilon} \newcommand{\VorX}[1]{\mathcal{V} \pth{#1}} \newcommand{\Polygon}{\mathsf{P}} \newcommand{\IntRange}[1]{[ #1 ]}…

A generalization of the Borsuk-Ulam theorem to Stiefel manifolds is considered. This theorem is applied to derive bounds on $d$ that guarantee-for a given set of $m$ measures in $\mathbb{R}^d$-the existence of $k$ mutually orthogonal…

Let $d \geq 3$ be a natural number. We show that for all finite, non-empty sets $A \subseteq \mathbb{R}^d$ that are not contained in a translate of a hyperplane, we have \[ |A-A| \geq (2d-2)|A| - O_d(|A|^{1- \delta}),\] where $\delta >0$ is…

In this paper we study multi-parameter projection theorems for fractal sets. With the help of these estimates, we recover results about the size of $A \cdot A+...+A \cdot A$, where $A$ is a subset of the real line of a given Hausdorff…

A famous conjecture of Erd\H{o}s asserts that for $k\ge 3$, the maximum number of edges in an $n$-vertex $k$-uniform hypergraph without $s+1$ pairwise disjoint edges is $\max\{\binom{n}{k}-\binom{n-s}{k},\binom{sk+k-1}{k}\}$. This problem…

Let $ES(n)$ be the minimal integer such that any set of $ES(n)$ points in the plane in general position contains $n$ points in convex position. The problem of estimating $ES(n)$ was first formulated by Erd\H{o}s and Szekeres, who proved…

Based on a result of Makeev, in 2012 Blagojevi\'c and Karasev proposed the following problem: given any positive integers $m$ and $1\leq \ell\leq k$, find the minimum dimension $d=\Delta(m;\ell/k)$ such that for any $m$ mass distributions…

The Erd\H os Matching Conjecture states that the maximum size $f(n,k,s)$ of a family $\mathcal{F}\subseteq \binom{[n]}{k}$ that does not contain $s$ pairwise disjoint sets is $\max\{|\mathcal{A}_{k,s}|,|\mathcal{B}_{n,k,s}|\}$, where…

The Erd\H{o}s-Szekeres conjecture states that any set of more than $2^{n-2}$ points in the plane with no three on a line contains the vertices of a convex $n$-gon. Erd\H{o}s, Tuza, and Valtr strengthened the conjecture by stating that any…

Let $X$ be a normal and geometrically integral projective variety over a global field $K$ and let $\overline{D}$ be an adelic Cartier divisor on $X$. We prove a conjecture of Chen, showing that the essential minimum…

Let $\partial \,\mathcal{C}$ be the boundary of a compact convex body $\mathcal{C}$ in $\mathbb{R}^n,\, n\geq 2$, and $O$ be an interior point of $\mathcal C$. Every straight line $l$ containing $O$ cuts from $\mathcal{C}$ a segment $[AB]$…

Dirac (1952) proved that every connected graph of order $n>2k+1$ with minimum degree more than $k$ contains a path of length at least $2k+1$. Erd\H{o}s and Gallai (1959) showed that every $n$-vertex graph $G$ with average degree more than…

As a variant of the celebrated Szemer\'edi--Trotter theorem, Guth and Katz proved that $m$ points and $n$ lines in $\mathbb{R}^3$ with at most $\sqrt{n}$ lines in a common plane must determine at most $O(m^{1/2}n^{3/4})$ incidences for…

We construct a weakly compact convex subset of $\ell^2$ with nonempty interior that has an isolated maximal element, with respect to the lattice order $\ell _+^2$. Moreover, the maximal point cannot be supported by any strictly positive…

We prove an analog of the Szemer\'edi-Trotter theorem in the plane for definable curves and points in any o-minimal structure over an arbitrary real closed field $\mathrm{R}$. One new ingredient in the proof is an extension of the well…

A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order…

This paper investigates the Erd\H{o}s distinct subset sums problem in $\mathbb{Z}^k$. Beyond the classical variance method, using alternative statistical quantities like $\mathbb{E}[\|X\|_1]$ and $\mathbb{E}[\|X\|_3^3]$ can yield better…