摘要
用二进制数来表示完全图的各种组合,借助计算机编程可从完全图的各种组合中寻找出ramsey图。5个顶点的Ramsey图是最基本的Ramsey图,这种基本方法为寻找更复杂的Ramsey图提供了基础。
This paper use the binary numbers to represent the complete graph of various combinations,with the help of the computer from the complete graph to find out Ramsey map.The five vertices of the graph Ramsey is the most basic Ramsey drawing,the basic method for finding the more complex Ramsey map provides a basis.
出处
《电脑编程技巧与维护》
2012年第8期12-13,19,共3页
Computer Programming Skills & Maintenance