Related papers: Coset intersection graphs for groups
We study the equivalence relation on the set of acyclic orientations of an undirected graph G generated by source-to-sink conversions. These conversions arise in the contexts of admissible sequences in Coxeter theory, quiver…
A graph $G=(V,E)$ is a geometric intersection graph if every node $v \in V$ is identified with a geometric object of some particular type, and two nodes are adjacent if the corresponding objects intersect. Geometric intersection graph…
The intersection growth of a group $G$ is the asymptotic behavior of the index of the intersection of all subgroups of $G$ with index at most $n$, and measures the Hausdorff dimension of $G$ in profinite metrics. We study intersection…
For G = SL(3,R) and G = SO(2,n), we give explicit, practical conditions that determine whether or not a closed, connected subgroup H of G has the property that there exists a compact subset C of G with CHC = G. To do this, we fix a Cartan…
It is shown that for any finitely generated subgroups H and K of a free group F, and for any element g in F the double coset HgK is closed in the profinite topology of F.
The interplay between groups and graphs have been the most famous and productive area of algebraic graph theory. In this paper, we introduce and study the graphs whose vertex set is group G such that two distinct vertices a and b having…
We determine the structure of the finite groups with the property that every cyclic subgroup is the intersection of maximal subgroups, comparing this property with the one where all proper subgroups are intersections of maximal subgroups.
In this work, we introduce the \emph{interval permutation segment (IP-SEG)} model that naturally generalizes the geometric intersection models of interval and permutation graphs. We study properties of two graph classes that arise from the…
Let $H$ and $K$ be subgroups of a finite group $G$. Pick $g \in G$ uniformly at random. We study the distribution induced on double cosets. Three examples are treated in detail: 1) $H = K = $ the Borel subgroup in $GL_n(\mathbb{F}_q)$. This…
Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…
Intersection graphs are very important in both theoretical as well as application point of view. Depending on the geometrical representation, different type of intersection graphs are defined. Among them interval, circular-arc, permutation,…
The intersection graph $\Delta_G$ of a finite group $G$ is a simple graph with vertices the non-trivial proper subgroups of $G$, and an edge between two vertices if their corresponding subgroups intersect non-trivially. These graphs were…
A random intersection graph is constructed by independently assigning a subset of a given set of objects $W,$ to each vertex of the vertex set $V$ of a simple graph $G.$ There is an edge between two vertices of $V,$ iff their respective…
Let $k$ be a positive integer and let $G$ be a graph with $n$ vertices. A connected $k$-subpartition of $G$ is a collection of $k$ pairwise disjoint sets (a.k.a. classes) of vertices in $G$ such that each set induces a connected subgraph.…
Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks…
In this paper the structure of the Cayley graphs and G-graphs of some gyro-groups are studied and some properties of them will be proved. Moreover we review some special gyro-groups including: gyro-commutative gyrogroups, dihedral…
We study graphs of (generalized) joins and intersections of finitely generated subgroups of a free group. We show how to disprove a lemma of Imrich and M\"uller on these graphs and how to repair this lemma.
In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn).
In this survey, we have attempted to show some developmental milestones on the characterizations of intersection graphs of hypergraphs. The theory of intersection graphs of hypergraphs has been a classical topic in the theory of special…
A subset $Y$ of the general linear group $\operatorname{GL}(n,q)$ is called $t$-intersecting if $\operatorname{rk}(x-y)\le n-t$ for all $x,y\in Y$, or equivalently $x$ and $y$ agree pointwise on a $t$-dimensional subspace of…