相关论文: Regular embeddings of multigraphs

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

We prove that all finite graphs of groups with cyclic vertex and edge groups act freely and isometrically on a complete, nonpositively curved geodesic metric space.

It is well-known that every vertex-transitive graph admits a representation as a coset graph. In this paper, we extend this construction by introducing monodromy graphs defined through double cosets. Our main result establishes that every…

We prove a topological rigidity result for simple, thick, hyperbolic P-manifolds of dimension 2: isomorphism of the fundamental groups implies homeomorphism of the P-manifolds. An immediate application is a diagram rigidity theorem for…

Let $(M,g)$ be a $C^\infty$-smooth, $n$-dimensional Riemannian manifold which is diffeomorphic to $\RR^n$ and admit an action of a properly discontinuous and cocompact group. This work proves the existence of a $C^\infty$ equivariant…

We prove two results about the natural representation of a group G of automorphisms of a normal projective threefold X on its second cohomology. We show that if X is minimal then G, modulo a normal subgroup of null entropy, is embedded as a…

In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…

We study the problem of isometrically embedding a two-dimensional Riemannian manifold into Euclidean three-space. It is shown that if Gaussian curvature vanishes to finite order and its zero set consists of two smooth curves tangent at a…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

We prove that a Cayley graph can be embedded in the euclidean plane without accumulation points of vertices if and only if it is the 1-skeleton of a Cayley complex that can be embedded in the plane after removing redundant simplices. We…

Let $V$ and $V'$ be vector spaces of dimension $n$ and $n'$, respectively. Let $k\in\{2,...,n-2\}$ and $k'\in\{2,...,n'-2\}$. We describe all isometric and $l$-rigid isometric embeddings of the Grassmann graph $\Gamma_{k}(V)$ in the…

Let $P$ be a set of $n \geq 5$ points in convex position in the plane. The path graph $G(P)$ of $P$ is an abstract graph whose vertices are non-crossing spanning paths of $P$, such that two paths are adjacent if one can be obtained from the…

The $k$-token graph $T_k(G)$ is the graph whose vertices are the $k$-subsets of vertices of a graph $G$, with two vertices of $T_k(G)$ adjacent if their symmetric difference is an edge of $G$. We explore when $T_k(G)$ is a well-covered…

We prove that every finite arc-transitive graph of valency twice a prime admits a nontrivial semiregular automorphism, that is, a non-identity automorphism whose cycles all have the same length. This is a special case of the Polycirculant…

We describe sufficient conditions which guarantee that a finite set of mapping classes generate a right-angled Artin group quasi-isometrically embedded in the mapping class group. Moreover, under these conditions, the orbit map to…

We characterize which automorphisms of an arbitrary complete bipartite graph $K_{n,m}$ can be induced by a homeomorphism of some embedding of the graph in $S^3$.

A circuit double cover of a bridgeless graph is a collection of even subgraphs such that every edge is contained in exactly two subgraphs of the given collection. Such a circuit double cover describes an embedding of the corresponding graph…

Let K be the family of graphs on omega_1 without cliques or independent subsets of size omega_1 . We prove that: 1) it is consistent with CH that every G in K has 2^{omega_1} many pairwise non-isomorphic subgraphs, 2) the following…

Let $G$ be a group of permutations acting on an $n$-vertex set $V$, and $X$ and $Y$ be two simple graphs on $V$. We say that $X$ and $Y$ are $G$-isomorphic if $Y$ belongs to the orbit of $X$ under the action of $G$. One can naturally…

We prove an equivariant version of the classical Menger-Nobeling theorem regarding topological embeddings: Whenever a group $G$ acts on a finite-dimensional compact metric space $X$, a generic continuous equivariant function from $X$ into…