ramsey_R2
Compute the largest clique and largest independent set in G.
G
This can be used to estimate bounds for the 2-color Ramsey number R(2;s,t) for G.
R(2;s,t)
This is a recursive implementation which could run into trouble for large recursions. Note that self-loop edges are ignored.
G (NetworkX graph) – Undirected graph
max_pair – Maximum clique, Maximum independent set.
(set, set) tuple