bg de en es fr it nl pl pt sv tr zh

ramsey numbers

Tight bounds on off-diagonal Ramsey numbers

Anurag Bishnoi

One of the oldest open problem in Ramsey theory has been solved. We now know the asymptotics of Ramsey numbers , for any fixed , up-to log factors. Last month, Domagoj Bradač showed that for any fixed and (where the term is hiding log factors), using a beautiful finite-geometric...

Coloring projective spaces and Ramsey theory

Anurag Bishnoi

What is the minimum number of colors needed to color the points of the Fano plane such that there is no monochromatic line? It is a nice exercise to prove that two colors do not suffice. This fact has been known at least since the 1956 paper of Richardson that introduced the notion of...

The Rank-Ramsey problem

Anurag Bishnoi

The Ramsey number is the smallest such that every graph on vertices either contains a clique of size or an independent set of size . Ramsey’s theorem implies that these numbers always exist, and determining them (precisely or asymptotically) has been a major challenge in mathematics for the...