It is commonly believed that vertex-transitive graphs (and in particular Cayley graphs) tend to contain hamilton cycles. The only known connected vertex-transitive graphs without hamilton cycles are K ...

It is known that every matching polynomial has only real roots. See [1,2]. It would be interesting to find a vertex transitive graph whose matching polynomial has a nonsimple root. Such a graph would ...