Skip to main content

All Questions

Filter by
Sorted by
Tagged with
20 votes
6 answers
879 views

Hamiltonian paths where the vertices are integer partitions

I have been working on this problem for several months now but have not made much progress. It concerns the set of all integer partitions of n. Let the vertices of the graph G=G(n) denote all the p(n) ...
1 vote
1 answer
300 views

Hamiltonian cycles -- Partition function

Assume a complete undirected graph $G'=(\mathcal{V}',\mathcal{E}')$ and the partirion function: $$\sum_{\boldsymbol{x}\in \{-1,+1\}^n} \prod_{\left(i,j\right)\in \mathcal{E}'} \left[1+x_{i}x_{j}\...