19.98 (2018)

Solved

A connected graph $\Sigma$ is a symmetrical extension of a graph $\Gamma$ by a graph $\Delta$ if there exist a vertex-transitive group $G$ of automorphisms of $\Sigma$ and an imprimitivity system $\sigma$ of $G$ on the set of vertices of $\Sigma$ such that the quotient graph $\Sigma/\sigma$ is isomorphic to $\Gamma$ and blocks of $\sigma$ generate in $\Sigma$ subgraphs isomorphic to $\Delta$.
$\qquad$ (a) Let $\Gamma$ be a locally finite Cayley graph of a finitely presented group, and $\Delta$ a finite graph. Are there only finitely many symmetrical extensions of $\Gamma$ by $\Delta$?
$\qquad$ (b) Let $\Gamma$ be a locally finite graph which has the property of $k$-contractibility for some positive integer $k$ (see the definition in (V. I. Trofimov, Proc. Steklov Inst. Math., 279, suppl. 1 (2012), 107–112); note that any $\Gamma$ from (a) is such a graph) and let $\Delta$ be a finite graph. Are there only finitely many symmetrical extensions of $\Gamma$ by $\Delta$?

Progress

(a) No, not always, as follows from the construction in the proof of Theorem H in (M. de la Salle, R. Tessera, J. Topology, 12 (2019), 705–743).
(b) No, not always as follows from the construction in the proof of Theorem H in (M. de la Salle, R. Tessera, J. Topology, 12 (2019), 705–743).

Comments

All comments are the responsibility of the user. Comments appearing on this page are not verified for correctness. Please keep posts mathematical and on topic. If you want to submit a proof (or a partial proof), please use the dedicated proof submission form rather than posting it in the comments.
Order by newest first or oldest first.

No comments yet. Be the first to comment.

Proof claims

Proof claims are the responsibility of the submitter. Appearance here does not mean the claim has been checked for mathematical correctness. Moderators only screen for spam, abuse, and obviously low-effort submissions.

No proof claims yet.