Related papers: Frucht's Theorem without Choice
Tutte's 3-flow conjecture asserts that every 4-edge-connected graph has a nowhere-zero 3-flow. In this note we prove that every regular graph of valency at least four admitting a solvable arc-transitive group of automorphisms admits a…
In this note we prove the classical decomposition theorems for certain subgroups of the automorphism group of the Bruhat-Tits tree associated to $\mathrm{PGL}_{2}(F)$, where $F$ is a local field. The results can be used to understand the…
It is known that, if we take a countable model of Zermelo--Fraenkel set theory ZFC and "undirect" the membership relation (that is, make a graph by joining $x$ to $y$ if either $x\in y$ or $y\in x$), we obtain the Erd\H{o}s--R\'enyi random…
Let L be a countable elementary language, N be a Fraisse limit. We consider free amalgamation for L-structures where L is arbitrary. If free amalgamation for finitely generated substructures exits in N, then it is a stationary independece…
It was proved that for any finite set of elements of a free product of residually finite groups such that no two of them belong to conjugate cyclic subgroups and each of them do not belong to a subgroup which is conjugate a to free factor…
Suppose that a finite group $G$ admits a Frobenius group of automorphisms $FH$ with kernel $F$ and complement $H$ such that the fixed-point subgroup of $F$ is trivial: $C_G(F)=1$. In this situation various properties of $G$ are shown to be…
We prove that an arbitrary compact metrizable group can be realized as the automorphism group of a graphing; this is a continuous analogue to Frucht's theorem recovering arbitrary finite groups are automorphism groups of finite graphs. The…
In this paper, we consider certain cardinals in ZF (set theory without AC, the Axiom of Choice). In ZFC (set theory with AC), given any cardinals C and D, either C <= D or D <= C. However, in ZF this is no longer so. For a given infinite…
We prove a tropical analogue of the theorem of Hurwitz: a leafless metric graph of genus $g \ge 2$ has at most $12$ automorphisms when $g = 2$; $2^g g!$ automorphisms when $g \ge 3$. These inequalities are optimal; for each genus, we give…
In 1981, Lubiw proved that the fixed point free automorphism problem (FPFAut) is NP-complete: given a graph G, determine whether there exists an automorphism that maps no vertex of G to itself. We revisit this problem and prove that FPFAut…
The complexity of graph homomorphism problems has been the subject of intense study. It is a long standing open problem to give a (decidable) complexity dichotomy theorem for the partition function of directed graph homomorphisms. In this…
We prove that any isometry of the graph of cyclic splittings of a finitely generated free group $F_N$ of rank $N\ge 3$ is induced by an outer automorphism of $F_N$. The same statement also applies to the graphs of maximally-cyclic…
A group $G$ is said to be totally $2$-closed if in each of its faithful permutation representations, say on a set $\Omega$, $G$ is the largest subgroup of $\mathrm{Sym}(\Omega)$ which leaves invariant each of the $G$-orbits for the induced…
This paper opens and discusses the question originally due to Daniel Herden, who asked for which graph $(\mu,R)$ we can find a family $\{\mathbb G_\alpha: \alpha < \mu\}$ of abelian groups such that for each $\alpha,\beta\in\mu$:…
We study locally closed transformation monoids which contain the automorphism group of the random graph. We show that such a transformation monoid is locally generated by the permutations in the monoid, or contains a constant operation, or…
If $G$ is a free product of finite groups, let $\Sigma Aut_1(G)$ denote all (necessarily symmetric) automorphisms of $G$ that do not permute factors in the free product. We show that a McCullough-Miller [D. McCullough and A. Miller, {\em…
The symmetric states on a quasi local C*-algebra on the infinite set of indices J are those invariant under the action of the group of the permutations moving only a finite, but arbitrary, number of elements of J. The celebrated De Finetti…
An automorphism of a graph product of groups is conjugating if it sends each factor to a conjugate of a factor (possibly different). In this article, we determine precisely when the group of conjugating automorphisms of a graph product…
In this article, we will show that the automorphism group of any hypergraph is essentially equal to the determinant of some matrix over a ring generated from the set of ground points. With this, we are also able to determine whether two…
In a recent paper [3], the authors introduced a map $\mathcal{F}$ which associates a Deitmar scheme (which is defined over the field with one element, denoted by $\mathbb{F}_1$) with any given graph $\Gamma$. By base extension, a scheme…