Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Campos, Marcelo, Jenssen, Matthew, Michelen, Marcus, Sahasrabudhe, Julian
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A polynomial improvement for the odd cycle-complete Ramsey numbers
by: Campos, Marcelo, et al.
Published: (2025)

Realizability of hypergraphs and high-dimensional contingency tables with random degrees and marginals
by: Christo, Nicholas, et al.
Published: (2024)

The random stable roommates problem typically has no solution
by: Chin, Byron, et al.
Published: (2026)

Upper bounds for multicolour Ramsey numbers
by: Balister, Paul, et al.
Published: (2024)

Non-existence probabilities and lower tails in the critical regime via Belief Propagation
by: Jenssen, Matthew, et al.
Published: (2026)

The largest $K_r$-free set of vertices in a random graph
by: Bohman, Tom, et al.
Published: (2026)

The geometry of the giant component of random geometric graphs
by: Dubin, Karoline, et al.
Published: (2026)

The limiting spectral law for sparse iid matrices
by: Sah, Ashwin, et al.
Published: (2023)

On the Spielman-Teng Conjecture
by: Sah, Ashwin, et al.
Published: (2024)

The sparse circular law, revisited
by: Sah, Ashwin, et al.
Published: (2023)

An exponential improvement for diagonal Ramsey
by: Campos, Marcelo, et al.
Published: (2023)

An update on multicolor Ramsey lower bounds
by: Campos, Marcelo, et al.
Published: (2026)

The multicolour size Ramsey number of a path
by: Beke, Csongor, et al.
Published: (2025)

A lower bound on the Ramsey number $R_k(k+1,k+1)$
by: Pudlák, Pavel, et al.
Published: (2024)

Lower tails for triangles inside the critical window
by: Jenssen, Matthew, et al.
Published: (2024)

A new lower bound for the multicolor Ramsey number $r_k(K_{2, t + 1})$
by: Taranchuk, Vladislav
Published: (2024)

Anticoncentration in Ramsey graphs and a proof of the Erdős-McKay conjecture
by: Kwan, Matthew, et al.
Published: (2022)

A lower bound on the spectrum of unimodular networks
by: Rahman, Mustazee
Published: (2016)

Lower bounds for the isoperimetric numbers of random regular graphs
by: Kolesnik, Brett, et al.
Published: (2013)

An exponential upper bound for induced Ramsey numbers
by: Aragão, Lucas, et al.
Published: (2025)

On random polynomials with an intermediate number of real roots
by: Michelen, Marcus, et al.
Published: (2023)

Singularity of the k-core of a random graph
by: Ferber, Asaf, et al.
Published: (2021)

On the number of spanning trees in random regular graphs
by: Greenhill, Catherine, et al.
Published: (2013)

Law of large numbers for the discriminant of random polynomials
by: Michelen, Marcus, et al.
Published: (2025)

A central limit theorem for the matching number of a sparse random graph
by: Glasgow, Margalit, et al.
Published: (2024)

A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
by: Bal, Deepak, et al.
Published: (2023)

Structure of lower tails in sparse random graphs
by: Chin, Byron
Published: (2023)

A Mathon-type construction for digraphs and improved lower bounds for Ramsey numbers
by: McCarthy, Dermot, et al.
Published: (2024)

A new lower bound for deterministic pop-stack-sorting
by: Bauer, Morgan, et al.
Published: (2023)

Ramsey lower bounds for bounded degree hypergraphs
by: Fan, Chunchao, et al.
Published: (2026)

Markov chains on trees: almost lower and upper directed cases
by: Fredes, Luis, et al.
Published: (2024)

On random locally flat-foldable origami
by: Hull, Thomas C., et al.
Published: (2025)

Probabilistic combinatorics at exponentially small scales
by: Sahasrabudhe, Julian
Published: (2025)

An exponential improvement for Ramsey lower bounds
by: Ma, Jie, et al.
Published: (2025)

An approximation of the Collatz map and a lower bound for the average total stopping time
by: Inselmann, Manuel
Published: (2024)

The local weak limit of $k$-dimensional hypertrees
by: Mészáros, András
Published: (2021)

The Lovász number of random circulant graphs
by: Bandeira, Afonso S., et al.
Published: (2025)

Concentration of the hypergraph's weak independence number
by: Vakhrushev, Stepan
Published: (2025)

The hypergraph removal process
by: Joos, Felix, et al.
Published: (2024)

Universality of the matching number in percolated regular graphs
by: Diskin, Sahar, et al.
Published: (2025)