For those who want a prefilter, Ramsey numbers are the minimum number of guests, written R(m, n), that must be invited so that at least m guests will know each other or at least n guests will not know each other.
Or in math: the minimum number of vertices in a fully connected graph that guarantee a clique of order m, or an independent set of order n.
Related thread about a year ago https://news.ycombinator.com/item?id=38590156
For those who want a prefilter, Ramsey numbers are the minimum number of guests, written R(m, n), that must be invited so that at least m guests will know each other or at least n guests will not know each other.
Or in math: the minimum number of vertices in a fully connected graph that guarantee a clique of order m, or an independent set of order n.
What do you mean by "fully connected" here?
For every set of two vertices, there is at least one path that connects them.