I have been thinking a lot about the clique problem and the reason for its complexity recently, and have been studying the worst-case graphs, complete graphs.

I am particularly interested in what "forms" the "same" graph can take on, if you alter its shape in your imagination, without "changing" it in any way and the smallest dimension you can reach with it. (A very joyful activity!)

While reading the wikipedia article today, I stumbled upon the following facts:

1.) Kuratowski showed that $K_4$ is not linklessly embeddable in 2-dimensional euclidean space.

2.) Conway and Gordon showed that $K_6$ is not linklessly embeddable in 3-dimensional space.

It seems to me, that if you go 1 dimension higher all these graphs can be linklessly embedded.

My question: Is the following conjecture true?

$\forall n \in N, n>=2 : K_{2n}$ is not linklessly embeddable in n-dimensional euclidean space. It is however, linklessly embeddable in $(n+1)$-dimensional euclidean space.

It seems very likely to me, that Kuratowski's theorem and the result of Conway and Gordon are "just" particular cases of something far bigger, which is hard to grasp.

I would like to prove it myself, but unfortunately I lack the ability and the knowledge.

The technique that Conway and Gordon apply in their paper however, as far as I could understand, seems like there may be a chance to generalize their approach.

- Serverfault Help
- Superuser Help
- Ubuntu Help
- Webapps Help
- Webmasters Help
- Programmers Help
- Dba Help
- Drupal Help
- Wordpress Help
- Magento Help
- Joomla Help
- Android Help
- Apple Help
- Game Help
- Gaming Help
- Blender Help
- Ux Help
- Cooking Help
- Photo Help
- Stats Help
- Math Help
- Diy Help
- Gis Help
- Tex Help
- Meta Help
- Electronics Help
- Stackoverflow Help
- Bitcoin Help
- Ethereum Help