| 单词 | Tait's Hamiltonian Graph Conjecture |
| 释义 | Tait's Hamiltonian Graph ConjectureEvery 3-connected cubic Graph (each Vertex has Valency 3)has a Hamiltonian Circuit. Proposed by Tait in 1880 and refuted by W. T. Tutte in 1946 with a counterexample,Tutte's Graph. If it had been true, it would have implied the Four-Color Theorem. A simpler counterexamplewas later given by Kozyrev and Grinberg. See also Hamiltonian Circuit, Tutte's Graph, Vertex (Graph)
Honsberger, R. Mathematical Gems I. Washington, DC: Math. Assoc. Amer., pp. 82-89, 1973. |
| 随便看 |
|
数学辞典收录了8975条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。