Related papers: Graph decompositions in projective geometries

Let $\boldsymbol{\Lambda}\,(=\mathbb{F}^{n^{3}})$, where $\mathbb{F}$ is a field with $|\mathbb{F}|>2$, be the space of structure vectors of algebras having the $n$-dimensional $\mathbb{F}$-space $V$ as the underlying vector space. Also let…

Let $\Gamma=(X,\mathcal{R})$ denote a finite, simple, connected, and undirected non-bipartite graph with vertex set $X$ and edge set $\mathcal{R}$. Fix a vertex $x \in X$, and define $\mathcal{R}_f = \mathcal{R} \setminus \{yz \mid…

The cyclic subgroup graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with cyclic subgroups as a vertex set and two distinct vertices $H_1$ and $H_2$ are adjacent if and only if $H_1 \leq H_2$ and there does not exist any…

We consider any classical Grassmannian geometry $\Gamma$; that is, any projective or polar Grassmann space. Suppose every line in $\Gamma$ contains $s+1$ points. Then we classify all sets of points in $\Gamma$ of cardinality $s+1$, with the…

Let $\Gamma$ be a simple finite graph with vertex set $V(\Gamma)$ and edge set $E(\Gamma)$. Let $\mathcal{R}$ be an equivalence relation on $V(\Gamma)$. The $\mathcal{R}$-super $\Gamma$ graph $\Gamma^{\mathcal{R}}$ is a simple graph with…

Let $q$ be an odd prime power, let $n\ge 2$, and let $V\subsetneq \mathbb F_{q^n}$ be a proper $\mathbb F_q$-vector subspace. Given a nonzero quadratic form $Q(X,Y)\in \mathbb F_{q^n}[X,Y]$, we consider the graph $\Gamma(Q,V)$ that…

In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…

Let $\Gamma(G)$ be the Gruenberg-Kegel graph of a finite group $G$. We prove that if $G$ is solvable and $\sigma$ is a cut-set for $\Gamma(G)$, then $G$ has a $\sigma$-series of length $5$ whose factors are controlled. As a consequence, we…

We study the topological types of pants decompositions of a surface by associating to any pants decomposition $P,$ in a natural way its pants decomposition graph, $\Gamma(P).$ This perspective provides a convenient way to analyze the…

The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…

In this paper, we present a classification of $2$-designs with $\gcd(r,\lambda)=1$ admitting flag-transitive automorphism groups. If $G$ is a flag-transitive automorphism group of a non-trivial $2$-design $\mathcal{D}$ with…

A graph is reconstructible if it is determined up to isomorphism from the collection of all its one-vertex-deleted subgraphs, known as the deck of G. The Reconstruction Conjecture (RC) posits that every finite simple graph with at least…

We investigate the relationship between finite groups and incidence geometries through their automorphism structures. Building upon classical results on the realizability of groups as automorphism groups of graphs, we develop a general…

Flip graphs are a ubiquitous class of graphs, which encode relations induced on a set of combinatorial objects by elementary, local changes. Skeletons of associahedra, for instance, are the graphs induced by quadrilateral flips in…

Let I(p,v) be Bourdon's building, the unique simply-connected 2-complex such that all 2-cells are regular right-angled hyperbolic p-gons and the link at each vertex is the complete bipartite graph K(v,v). We investigate and mostly determine…

We consider ordered pairs $(X,\mathcal{B})$ where $X$ is a finite set of size $v$ and $\mathcal{B}$ is some collection of $k$-element subsets of $X$ such that every $t$-element subset of $X$ is contained in exactly $\lambda$ "blocks" $B\in…

Let $k$, $\lambda$ and $\mu$ be positive integers. A decomposition of a multigraph $ \lambda G$ into edge-disjoint subgraphs $G_1, \ldots , G_k$ is said to be \emph{enclosed} by a decomposition of a multigraph $\mu H$ into edge-disjoint…

For a graph $G$, the $\gamma$-graph of $G$, $G(\gamma)$, is the graph whose vertices correspond to the minimum dominating sets of $G$, and where two vertices of $G(\gamma)$ are adjacent if and only if their corresponding dominating sets in…

Let G' be a subgraph of a graph G. We define a down-link from a (K_v,G)-design B to a (K_n,G')-design B' as a map f:B->B' mapping any block of B into one of its subgraphs. This is a new concept, closely related with both the notion of…

It is shown that, given any finite dimensional, split basic algebra $\Lambda = K\Gamma/I$ (where $\Gamma$ is a quiver and $I$ an admissible ideal in the path algebra $K \Gamma$), there is a finite list of affine algebraic varieties, the…