Related papers: Flip Graphs
We study flip-graphs of triangulations on topological surfaces where distance is measured by counting the number of necessary flip operations between two triangulations. We focus on surfaces of positive genus $g$ with a single boundary…
We obtain the scaling limits of random graphs drawn uniformly in three families of intersection graphs: permutation graphs, circle graphs, and unit interval graphs. The two first families typically generate dense graphs, in these cases we…
A main result is that, roughly, a dense set of the infinitesimal trace-preserving deformations of a semicircular system $s_1,..., s_n$ arise from one-parameter groups of automorphisms of the free-group factor $L(F(n))$ generated by…
An interesting fact is that most of the known connected $2$-arc-transitive nonnormal Cayley graphs of small valency on finite simple groups are $(\mathrm{A}_{n+1},2)$-arc-transitive Cayley graphs on $\mathrm{A}_n$. This motivates the study…
In this paper we develop three characterizations for isomorphism of graphs. The first characterization is obtained by associating certain bitableaux with the graphs. We order these bitableaux by suitably defined lexicographic order and…
Skew morphisms, which generalise automorphisms for groups, provide a fundamental tool for the study of regular Cayley maps and, more generally, for finite groups with a complementary factorisation $G=BY$, where $Y$ is cyclic and core-free…
A graph $\G$ is {\em symmetric} or {\em arc-transitive} if its automorphism group $\Aut(\G)$ is transitive on the arc set of the graph, and $\G$ is {\em basic} if $\Aut(\G)$ has no non-trivial normal subgroup $N$ such that the quotient…
In this work, given $(R,\frak m)$ a finite commutative local ring with identity and $k \in \mathbb{N}$ with $(k,|R|)=1$, we study the number of cliques of any size in the Cayley graph $G_R(k)=Cay(R,U_R(k))$ %and $W_R(k)=Cay(R,S_R(k))$ with…
Let g be a complex semisimple Lie algebra, and f : g --> g/G the adjoint quotient map. Springer theory of Weyl group representations can be seen as the study of the singularities of f. We give a generalization of Springer theory to visible,…
We express the discrete Ricci curvature of a graph as the minimal eigenvalue of a family of matrices, one for each vertex of a graph whose entries depend on the local adjaciency structure of the graph. Using this method we compute or bound…
A graph is edge-transitive if the natural action of its automorphism group on its edge set is transitive. An automorphism of a graph is semiregular if all of the orbits of the subgroup generated by this automorphism have the same length.…
The fine 1-curve graph of a surface is a graph whose vertices are simple closed curves on the surface and whose edges connect vertices that intersect in at most one point. We show that the automorphism group of the fine 1-curve graph is…
Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…
Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…
We call an oriented odd cycle alternating if it has exactly one vertex whose in-degree and out-degree are both positive. In this paper, we investigate whether certain graphs admit an orientation that avoids alternating odd cycles as…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
A $k$-orbit map is a map with its automorphism group partitioning the set of flags into $k$ orbits. Recently $k$-orbit maps were studied by Orbani\' c, Pellicer and Weiss, for $k \leq 4$. In this paper we use symmetry type graphs to extend…
We present a new family of graphs with remarkable properties. They are obtained by connecting the points of a random walk when their distance is smaller than a given scale. Their degree (number of neighbors) does not depend on the graph's…
We generalize the well known exchange property of Coxeter groups to the setting of edge-colored graphs. This work aims to unify and extend the results of our companion article, "odd Verma's theorem", which were originally established for…
The paper presents the complete classification of Automorphic Lie Algebras based on $\mathfrak{sl}_n (\mathbb{C})$, where the symmetry group $G$ is finite and the orbit is any of the exceptional $G$-orbits in $\overline{\mathbb{C}}$. A key…