Timeline for For which $n$ is there a permutation such that the sum of any two adjacent elements is a prime?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 8, 2016 at 6:29 | comment | added | Douglas Zare | $G$ is much more structured than a random graph. I'm not sure if that heuristically increases or decreases the chance of a Hamiltonian cycle. One thing we can check is how many Hamiltonian cycles it has, and compare that with a sample of random graphs with the same size and number of edges. | |
| Jun 7, 2016 at 8:40 | history | edited | Neil Strickland | CC BY-SA 3.0 |
added 5 characters in body
|
| Jun 7, 2016 at 8:35 | comment | added | Moritz Firsching | link to L. Pósa's paper: sciencedirect.com/science/article/pii/0012365X76900686 . | |
| Jun 7, 2016 at 8:27 | history | answered | Neil Strickland | CC BY-SA 3.0 |