Pith. sign in

REVIEW 5 cited by

A new lower bound for the Ramsey numbers $R(3,k)$

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 2505.13371 v1 pith:D5L7KBJT submitted 2025-05-19 math.CO math.PR

Marcelo Campos , Matthew Jenssen , Marcus Michelen , Julian Sahasrabudhe This is my paper · ORCID
classification math.COmath.PR
keywords lowerboundbiggfracgriffithsmorrisnumberspontiveros
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On a Ramsey--Tur\'{a}n variant of Roth's theorem

    math.CO 2025-07 accept novelty 8.0 of 10

    For any homogeneous linear equation over F_p, every solution-free set whose Cayley graph has sublinear independence number has sublinear size exactly when some nonempty subset of the coefficients sums to zero.

  2. Size-Ramsey numbers of tight paths

    math.CO 2025-07 conditional novelty 8.0 of 10

    For every fixed r and s, the minimum number of edges in a host hypergraph that forces a monochromatic r-uniform tight path on n vertices under any s-colouring grows only linearly in n.

  3. Off-Diagonal Ramsey Numbers for Linear Hypergraphs

    math.CO 2025-07 conditional novelty 7.0 of 10

    For every k≥4 and C>1 there is a linear k-uniform hypergraph H with off-diagonal Ramsey number r(H,K_n^{(k)}) at least the (k-2)-fold tower of 2^{(log n)^C}.

  4. On the Erd\H{o}s-Rogers function

    math.CO 2026-07 conditional novelty 5.0 of 10

    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.

  5. Recent progress in graph theory using expansion

    math.CO 2026-07 accept novelty 3.0 of 10

    Sublinear expansion—weak neighbourhood growth in sparse graphs—has resolved many long-standing extremal graph theory conjectures, and this survey organizes that progress.

Pith tools