REVIEW 18 cited by
A new lower bound for the Ramsey numbers R(3,k)
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
A new lower bound for the Ramsey numbers R(3,k)
read the original abstract
We prove a new lower bound for the off-diagonal Ramsey numbers, \[ R(3,k) \geq \bigg( \frac{1}{3}+ o(1) \bigg) \frac{k^2}{\log k }\, , \] thereby narrowing the gap between the upper and lower bounds to a factor of $3+o(1)$. This improves the best known lower bound of $(1/4+o(1))k^2/\log k$ due, independently, to Bohman and Keevash, and Fiz Pontiveros, Griffiths and Morris, resulting from their celebrated analysis of the triangle-free process. As a consequence, we disprove a conjecture of Fiz Pontiveros, Griffiths and Morris that the constant $1/4$ is sharp.
Forward citations
Cited by 18 Pith papers
-
Off-diagonal Ramsey numbers
Proves r(s, k) ≥ Ω(k^{s-1} / (log k)^{2s-4}) for fixed s ≥ 3 and k → ∞, nearly matching the Erdős-Szekeres upper bound and improving the Spencer lower bound for s ≥ 5.
-
An exponential improvement for Ramsey lower bounds
Establishes the first exponential improvement since 1947 to the lower bound on off-diagonal Ramsey numbers r(ℓ, Cℓ) for constant C > 1.
-
The independence number of uncrowded hypergraphs: bounds matching the shattering threshold
Uncrouded k-uniform hypergraphs attain independence number (1-ε)n ((log Δ)/((k-1)Δ))^{1/(k-1)} for large Δ, matching the shattering threshold.
-
A double-exponential lower bound for $r_4(5,n)$
r_4(5,n) is at least 2^{2^{c n^{1/7}}}, determining the tower growth rate of r_k(k+1,n) for hypergraph Ramsey numbers.
-
New Tower-Type Lower Bounds for Hypergraph Ramsey Numbers
Improves r_k(k+1,k+1) > s_3(⌊k/2⌋-2) for k≥6 and proves s_3(k) ≥ (twr_{k-2}(2))^2 for k≥5, yielding r_k(k+1,k+1) > (twr_{⌊k/2⌋-4}(2))^2 for k≥14.
-
Prime Certificates for Exact Vertex-Coprime Ramsey Numbers
The vertex-coloring coprime Ramsey number R_cop(k1,...,kc) equals the prime p indexed by sum(ki-1).
-
A Note on Generalized Erd\H{o}s-Rogers Problems
f^{(4)}_{5^{-},6}(N) equals (log log N) to the Theta(1) power, with improved lower bounds r_4(6,n) >= 2^{2^{c sqrt(n)}} and r_k(k+2,n).
-
A linear upper bound for zero-sum Ramsey numbers of bounded degree graphs
Zero-sum Ramsey numbers R(G, Γ) satisfy R(G, Γ) ≤ C n for bounded-degree n-vertex graphs G whenever |Γ| divides e(G).
-
A polynomial improvement for the odd cycle-complete Ramsey numbers
For every fixed odd ℓ > 7 the Ramsey number satisfies r(C_ℓ, K_k) ≥ k^{1 + 1/(ℓ-2) + ε_ℓ + o(1)} as k tends to infinity, for some positive ε_ℓ depending only on ℓ.
-
Induced/Incomparable versus Ramsey
Introduces H-exact graphs and computes or bounds f(H) for trees on k vertices, stars, paths, and matchings of n edges.
-
Induced/Incomparable versus Ramsey
Introduces H-exact graphs and determines maximum orders f(H) for trees, stars, paths, and matchings with explicit bounds and exact formulas.
-
Gaussian random graphs and Ramsey numbers
Simplified proof of exponential Ramsey lower bound improvements via Gaussian random graphs, with better quantitative constants than prior work.
-
On the Erd\H{o}s-Rogers function
The Erdős–Rogers function f_{s,s+1}(n) is Θ(√(n log n)) for every s ≥ 2, proved by a new random-graph construction.
-
Sharper Ramsey lower bounds from refined Gaussian estimates
The exponent in the probabilistic lower bound for R(ℓ, Cℓ) is increased by a positive amount (asymptotically Θ(p_C^{-1/2}/log C) as C→∞) via a refined Gaussian estimate.
-
Sharper Ramsey lower bounds from refined Gaussian estimates
The exponent in the lower bound for R(ℓ, Cℓ) increases by a positive amount for every fixed C>1, with asymptotic gain Θ(p_C^{-1/2}/log C) as C grows.
-
An improved double-exponential lower bound for $r_4(5,n)$
The Ramsey number r_4(5,n) is at least 2^{2^{Omega(n^{1/5})}}, an improvement over the prior 2^{2^{Omega(n^{1/7})}} achieved by reducing greedy layers in the construction from seven to five.
-
An improved double-exponential lower bound for $r_4(5,n)$
The paper establishes the improved lower bound r_4(5,n) >= 2^{2^{Omega(n^{1/5})}} for the 4-uniform 5-clique Ramsey number by reducing greedy local-maxima selection from seven layers to five in a modified construction.
-
Recent progress in graph theory using expansion
Sublinear expansion—weak neighbourhood growth in sparse graphs—has resolved many long-standing extremal graph theory conjectures, and this survey organizes that progress.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.