  We study groups acting vertex-transitively on connected, trivalent graphs
such that stabilizers of vertices are infinite. If the action is
edge-transitive, we prove that the graph has to be a tree. We analyze the case
where the action is not edge-transitive and fully classify the possible
$2$-ended graphs. We draw connections to Willis' scale function and re-prove a
result by Trofimov.
