|
|
A117130
|
|
Maximal number of cycles in complete graph on n nodes that can be unknotted when the graph is embedded in three-dimensional Euclidean space.
|
|
1
|
|
|
|
OFFSET
|
0,5
|
|
COMMENTS
|
For n <= 6 all cycles can be unknotted and the terms agree with A002807.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|