On vertex-transitive graphs with a unique Hamiltonian circle

Abstract: We will discuss graphs that have a unique Hamiltonian cycle and are vertex-transitive, which means there is an automorphism that takes any vertex to any other vertex. Cycles are the only examples with finitely many vertices, but the situation is more interesting for infinite graphs. (Infinite graphs do not have ``Hamiltonian cycles'', but there are natural analogues.) The case where the graph has only finitely many ends is not difficult, but we do not know whether there are examples with infinitely many ends. This is joint work in progress with Bobby Miraftab.

combinatoricsnumber theory

Audience: researchers in the topic

Lethbridge number theory and combinatorics seminar