Get all your news in one place.
100's of premium titles.
One app.
Start reading
LiveScience
LiveScience
Stephanie Pappas

Mathematicians make rare breakthrough on notoriously tricky 'Ramsey number' problem

A visual representation of Ramsey theorem for five nodes on a graph. Here, no triangle has edges that are all the same color, indicating no groups of three that are either all 'friends' or all 'strangers.' (Image credit: Richtom80 at English Wikipedia (CC-BY 3.0))

Mathematicians have made a breakthrough in one of the thorniest math problems out there — only the third major step forward in 75 years. 

The problem involves Ramsey numbers, a deceptively simple concept that is quite slippery, mathematically. A Ramsey number is the minimum size of a group needed to ensure that a certain number of nodes in that group are connected to one another. The most common metaphor is that of a party: How many people do you need to invite to a soiree to ensure that there will be either a group of three that will know each other or a group of three that are complete strangers?

Sign up to read this article
Read news from 100's of titles, curated specifically for you.
Already a member? Sign in here
Related Stories
Top stories on inkl right now
One subscription that gives you access to news from hundreds of sites
Already a member? Sign in here
Our Picks
Fourteen days free
Download the app
One app. One membership.
100+ trusted global sources.