单词 | Guy's Conjecture |
释义 | Guy's ConjectureGuy's conjecture, which has not yet been proven or disproven, states that the Crossing Number for a Complete Graph of order ![]() where ![]() ![]() The first few values are 0, 0, 0, 0, 1, 3, 9, 18, 36, 60, ... (Sloane's A000241). See also Crossing Number (Graph)
Sloane, N. J. A. SequenceA000241/M2772in ``An On-Line Version of the Encyclopedia of Integer Sequences.''http://www.research.att.com/~njas/sequences/eisonline.html and Sloane, N. J. A. and Plouffe, S.The Encyclopedia of Integer Sequences. San Diego: Academic Press, 1995. |
随便看 |
|
数学辞典收录了8975条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。