2 problems

Let $L$ be a transitive permutation group. It is semiprimitive if each of its normal subgroups is either transitive or semiregular, and it is graph-restrictive if there exists a co…

Let $c>0$. Let ${\mathcal F}_c$ be a finite family of graphs, let $G$ be an almost simple group, and let $\Gamma$ be a connected tetravalent $G$-arc-transitive graph with vertex…