Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
1 answer
80 views

What are the efficient algorithms to compute Hamiltonian paths on Cayley graphs of finite groups ? Can GAP do it?

The famous Lovasz conjecture predicts existence of the Hamiltonian path on Cayley graphs. In general finding such a path is NP-complete problem, but there are many heuristic algorithms. Question 1: ...
Alexander Chervov's user avatar
1 vote
1 answer
156 views

Sub-circle-free Christmas-gift-giving

Suppose there is a group of $n$ people giving gifts to one another. Everybody brings a gift but we want the gifts to be "well-distributed" in the group. By this I mean the following: In how many ...
Petra Schwer's user avatar
7 votes
1 answer
517 views

Paths in groups

Given a finite group $G$, write $K(G)$ for the complete digraph on the elements of $G$. Label the edge from $g$ to $h$ by element $g^{-1}h$. Question: For what groups does there exist a Hamiltonian ...
David Feldman's user avatar