Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1605.06054

On rotarily transitive graphs

Sébastien Martineau
View original source ↗Read source document ↗Export metadata ↓

Abstract

From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall that Cayley graphs can be defined as non-empty locally finite connected graphs endowed with a transitive group action such that any non-identity element acts without fixed point. We define a class of transitive graphs which are transitive in an "absolutely non-Cayley way": we consider graphs endowed with a transitive group action such that any element of the group acts with a fixed point. We call such graphs "rotarily transitive graphs", and we show that, even though there is no finite rotarily transitive graph with at least 2 vertices, there is an infinite locally finite connected rotarily transitive graph. The proof is based on groups built by Ivanov which are finitely generated, of finite exponent and have a small number of conjugacy classes. We also build infinite transitive graphs (which are not locally finite) any automorphism of which has a fixed point. This is done by considering "unit distance graphs" associated with the projective plane over suitable subfields of the real numbers.

Explore related subjects

math.COmath.GRmath.MG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sébastien Martineau. 2016-12-04. On rotarily transitive graphs. https://arxiv.org/abs/1605.06054

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗