相关论文: Constructions of graphs with any possible two-fold…

In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

When $S$ is a closed, orientable surface with genus $g(S) \geq 2$, we show that the automorphism group of the compression body graph $\mathcal{CB}(S)$ is the mapping class group. Here, vertices are compression bodies with exterior boundary…

It has long been known that a vertex-transitive graph $\Gamma$ is isomorphic to a double coset graph $\text{Cos}(G,H,S)$ of a transitive group $G\le\text{Aut}(\Gamma)$, a vertex stabilizer $H\le G$, and some subset $S\subseteq G$. We show…

A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. The work to date has focussed on a few special situations: when the groups are $p$-groups; when the…

We describe the outer automorphism group of a one-ended fundamental group of a graph of groups, when edge groups are cyclic, and vertex groups are torsion-free with cyclic centralizers. We show that in this case the outer automorphism group…

We consider the Grassmann graphs and dual polar graphs over the same finite field and show that, up to graph automorphism, for every dual polar graph there is the unique isometric embedding in the corresponding Grassmann graph.

A signed graph is said to be sign-symmetric if it is switching isomorphic to its negation. Bipartite signed graphs are trivially sign-symmetric. We give new constructions of non-bipartite sign-symmetric signed graphs. Sign-symmetric signed…

A certain signed adjacency matrix of the hypercube, which Hao Huang used last year to resolve the sensitivity conjecture, is closely related to the unique, 4-cycle free, 2-fold cover of the hypercube. We develop a framework in which this…

A graph $G$ is \emph{unstable} if its canonical double cover CDC$(G)$ has more automorphisms than Aut$(G)\times \mathbb{Z}_2$. A related problem asks when two non-isomorphic graphs share the same CDC. We unify both via \emph{lifting} and…

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

For affine symmetric groups we construct finite $W$-graphs corresponding to two-row shapes, and prove their uniqueness. This gives the first non-trivial family of examples of finite $W$-graphs in an affine type. We compare our construction…

We prove the following ``symmetric analogue'' of Lov\'asz's estimate (1975): if an $r$-partite hypergraph of rank $r\geqslant2$ has a cover of cardinality $n<\infty$, then it admits a cover of cardinality at most $nr/2$, which is invariant…

A graph $G$ is pseudo 2-factor isomorphic if the parity of the number of cycles in a 2-factor is the same for all 2-factors of $G$. Abreu et al. conjectured that $K_{3,3}$, the Heawood graph and the Pappus graph are the only essentially…

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

We give an elementary construction of polyhedra whose links are connected bipartite graphs, which are not necessarily isomorphic pairwise. We show, that the fundamental groups of some of our polyhedra contain surface groups. In particular,…

We introduce a topological invariant, it a type of a graph-manifold, which takes natural values. For a 4-dimensional graph-manifold, whose type does not exceed two, it is proved that its universal cover is bi-Lipschitz equivalent to a…

Let $S$ be a subset of the cyclic group $\Z_n$. The cyclic Haar graph $H(\Z_n,S)$ is the bipartite graph with color classes $\Z_n^+$ and $\Z_n^-,$ and edges $\{x^+,y^-\},$ where $x,y \in \Z_n$ and $y - x \in S$. In this paper we give…

Let $k$ and $l$ be integers, both at least 2. A $(k,l)$-bipartite graph is an $l$-regular bipartite multigraph with coloured bipartite sets of size $k$. Define $\chi(k,l)$ and $\mu(k,l)$ to be the minimum and maximum order of automorphism…

Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…