English
Related papers

Related papers: An exponential improvement for Ramsey lower bounds

200 papers

Let $\Delta_s=R(K_3,K_s)-R(K_3,K_{s-1})$, where $R(G,H)$ is the Ramsey number of graphs $G$ and $H$ defined as the smallest $n$ such that any edge coloring of $K_n$ with two colors contains $G$ in the first color or $H$ in the second color.…

Combinatorics · Mathematics 2015-07-07 Rujie Zhu , Xiaodong Xu , Stanisław Radziszowski

Amoroso and Masser proved that for every real $\epsilon > 0$, there exists a constant $c(\epsilon)>0$, such that for every algebraic number $\alpha$ with $\mathbb{Q}(\alpha)/\mathbb{Q}$ being a Galois extension, the height of $\alpha$ is…

Number Theory · Mathematics 2024-11-19 Jonathan Jenvrin

We prove that there is an absolute constant $c > 0$ such that for every $$a_0,a_1, \ldots,a_n \in [1,M]\,, \qquad 1 \leq M \leq \frac 14 \exp \left( \frac n9 \right)\,,$$ there are $$b_0,b_1,\ldots,b_n \in \{-1,0,1\}$$ such that the…

Number Theory · Mathematics 2024-10-17 Tamás Erdélyi

The Ramsey number $r_k(s,n)$ is the smallest integer $N$ such that every $N$-vertex $k$-graph contains either a copy of $K_s^{(k)}$ or an independent set of size $n$. A well-known conjecture of Erd\H{o}s and Hajnal states that for any fixed…

Combinatorics · Mathematics 2026-05-12 Chunchao Fan , Mingze Li , Qizhong Lin , Bo Ning

We introduce the list colouring extension of classical Ramsey numbers. We investigate when the two Ramsey numbers are equal, and in general, how far apart they can be from each other. We find graph sequences where the two are equal and…

Combinatorics · Mathematics 2020-08-13 N. Alon , M. Bucić , T. Kalvari , E. Kuperwasser , T. Szabó

Let $G$ be a graph and $\Gamma$ a finite abelian group. The zero-sum Ramsey number of $G$ over $\Gamma$, denoted by $R(G, \Gamma)$, is the smallest positive integer $t$ (if it exists) such that any edge-colouring $c:E(K_t)\to\Gamma$…

Combinatorics · Mathematics 2026-05-11 Jasmin Katz , Xiaopan Lian , Alexandru Malekshahian , Andrey Shapiro

For every $k\ge 2$ and $\Delta$, we prove that there exists a constant $C_{\Delta,k}$ such that the following holds. For every graph $H$ with $\chi(H)=k$ and every tree with at least $C_{\Delta,k}|H|$ vertices and maximum degree at most…

Combinatorics · Mathematics 2025-09-17 Richard Montgomery , Matías Pavez-Signé , Jun Yan

Let $K\_{[k,t]}$ be the complete graph on $k$ vertices from which a set of edges, induced by a clique of order $t$, has been dropped. In this note we give two explicit upper bounds for $R(K\_{[k\_1,t\_1]},\dots, K\_{[k\_r,t\_r]})$ (the…

Combinatorics · Mathematics 2014-12-15 Jonathan Chappelon , Luis Pedro Montejano , Jorge Luis Ramírez Alfonsín

We give an improved lower bound for the average of the Erd\H{o}s-Hooley function $\Delta(n)$, namely $\sum_{n\le x} \Delta(n) \gg_\varepsilon x(\log\log x)^{1+\eta-\varepsilon}$ for all $x\geqslant100$ and any fixed $\varepsilon$, where…

Number Theory · Mathematics 2024-05-24 Kevin Ford , Dimitris Koukoulopoulos , Terence Tao

Boros and Furedi (for d=2) and Barany (for abritrary d) proved that there exists a positive real number c_d such that for every set P of n points in R^d in general position, there exists a point of R^d contained in at least c_d…

Combinatorics · Mathematics 2012-03-22 Daniel Kral , Lukas Mach , Jean-Sebastien Sereni

We give a short proof that any k-uniform hypergraph H on n vertices with bounded degree \Delta has Ramsey number at most c(\Delta, k)n, for an appropriate constant c(\Delta, k). This result was recently proved by several authors, but those…

Combinatorics · Mathematics 2007-10-30 David Conlon , Jacob Fox , Benny Sudakov

Given an integer $m\geq2$, the Hardy--Littlewood inequality (for real scalars) says that for all $2m\leq p\leq\infty$, there exists a constant $C_{m,p}% ^{\mathbb{R}}\geq1$ such that, for all continuous $m$--linear forms…

Functional Analysis · Mathematics 2015-10-06 Gustavo Araujo , Daniel Pellegrino

We prove that there exist infinitely many coprime numbers $a$, $b$, $c$ with $a+b=c$ and $c>\operatorname{rad}(abc)\exp(6.563\sqrt{\log c}/\log\log c)$. These are the most extremal examples currently known in the $abc$ conjecture, thereby…

Number Theory · Mathematics 2024-06-05 Curtis Bright

The Bohnenblust-Hille inequality was obtained in 1931 and (in the case of real scalars) asserts that for every positive integer $N$ and every $m$-linear mapping $T:\ell_{\infty}^{N}\times...\times\ell_{\infty}^{N}\rightarrow \mathbb{R}$ one…

Functional Analysis · Mathematics 2015-10-01 Diogo Diniz , Gustavo Muñoz-Fernández , Daniel Pellegrino , Juan B. Seoane-Sepúlveda

As a result of 33 intercontinental Zoom calls, we characterise big Ramsey degrees of the generic partial order. This is an infinitary extension of the well known fact that finite partial orders endowed with linear extensions form a Ramsey…

Let $\varepsilon > 0$. We prove that there are constants $m_0=m_0(\varepsilon)$ and $\kappa=\kappa(\varepsilon) > 0$ for which the following holds: For every integer $m > m_0$ and every nontrivial Dirichlet character modulo $m$, there are…

Number Theory · Mathematics 2015-08-25 Paul Pollack

The classical recursive upper bound on hypergraph Ramsey numbers due to Erd\H{o}s and Rado states that for $2 \leq k < s \leq t$, \[ r_k(s,t) \leq 2^{\binom{r_{k-1}(s-1,t-1)}{k-1}}. \] In 2010, Conlon, Fox, and Sudakov introduced the…

Combinatorics · Mathematics 2026-05-19 Dániel Dobák , Eion Mulrenin

We show that for an $n$ dimensional complete non Ricci flat gradient steady Ricci soliton with potential function $f$ bounded above by a constant and curvature tensor $Rm$ satisfying $\overline{\lim}_{r\to \infty} r|Rm|<\frac{1}{5}$, then…

Differential Geometry · Mathematics 2019-08-29 Pak-Yeung Chan

We prove new upper bounds for the number of representations of an arbitrary rational number as a sum of three unit fractions. In particular, for fixed $m$ there are at most $\mathcal{O}_{\epsilon}(n^{3/5+\epsilon})$ solutions of…

Number Theory · Mathematics 2018-05-09 Christian Elsholtz , Stefan Planitzer

Building on recent work of Mattheus and Verstra\"ete, we establish a general connection between Ramsey numbers of the form $r(F,t)$ for $F$ a fixed graph and a variant of the Zarankiewicz problem asking for the maximum number of 1s in an…

Combinatorics · Mathematics 2024-04-25 David Conlon , Sam Mattheus , Dhruv Mubayi , Jacques Verstraëte