c*******k
发帖数: 1 | 1 Who knows how to use a BDD (binary Decision Diagram)-based technique to
determine R(3,4)? Please share your idea. Thanks!
v= R(m,n):
In the language of graph theory, the Ramsey number is the minimum number of
vertices such that all undirected simple graphs of order v contain a clique of
order m or an independent set of order n. |
|
