5 problems

Let $C_n(1,a_2,\dots,a_m)$ be an edge-transitive circulant graph. The parameters $a_2,\dots,a_m$ are connection parameters modulo $n$. General edge-transitive circulant conjecture.…

Let $C_n(1,a,b)$ be an edge-transitive circulant graph, where the connection parameters are taken modulo $n$. Edge-transitive 3-circulant conjecture. At least one of the following…

Stern's conjecture. Every edge-transitive propellor graph is isomorphic to one of the following:

Let $\Gamma$ be a propeller graph with four edge-orbits and let $G=\operatorname{Aut}(\Gamma)$. Four-edge-orbit propeller graph classification conjecture. One of the following must…

Let $\Gamma$ be a propeller graph with two edge-orbits and let $G=\operatorname{Aut}(\Gamma)$. Two-edge-orbit propeller graph classification conjecture. One of the following must h…