Talk:Knight's graph
 | This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Girth condition
[edit]The table claims the girth of this graph is 4 if n >= 3 and m >= 5. This a bit weird: the definition is fully symmetric in m and n, so why would the condition not also be symmetric? Anyway the condition does hold if n >= 5 and m >= 3, and also when n >= 4 and m >= 4. A better way of stating it is simply that the girth is infinity when n or m is less than 3 and 4 when n+m >= 8. For completeness we could also say that the girth is 6 when n+m=7 and 8 when n+m=6. --Saforrest (talk) 10:01, 7 December 2020 (UTC)