Year: 2019
Type: preprint
Abstract: We introduce uniformly vertex-transitive graphs as vertex-transitive graphs satisfying a stronger condition on their automorphism groups, motivated by a problem which arises from a Sinkhorn-type algorithm. We use the derangement graph $D(Γ)$ of a given graph $Γ$ to show that the uniform vertex-transitivity of $Γ$ is equivalent to the existence of cliques of sufficient size in $D(Γ)$. Using this method, we find examples of graphs that are vertex-transitive but not uniformly vertex-transitive, settling a previously open question. Furthermore, we develop sufficient criteria for uniform vertex-transitivity in the situation of a graph with an imprimitive automorphism group. We classify the non-Cayley uniformly vertex-transitive graphs on less than 30 vertices outside of two complementary pairs of graphs.
Source: arXiv (Cornell University)
Authors: Schmidt, Simon, Vogeli, Chase, Weber, Moritz
Institutions: Saarland University, Massachusetts Institute of Technology
Language: English
Topic: Finite Group Theory Research
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2991491601