Related papers: Cameron-Liebler sets in Hamming graphs
In this paper, we introduce the t-graphs defined on finitely-generate groups. We study some general aspects of the t-graphs on 2-generator groups, emphasising establishing necessary conditions for their connectedness. In particular, we…
We shall generalize the notion of a Laver table to algebras which may have many generators, several fundamental operations, fundamental operations of arity higher than 2, and to algebras where only some of the operations are…
For simply-laced quivers, we consider the fixed-point subalgebra of the quiver Hecke algebra under the homogeneous sign map. This leads to a new family of algebras we call alternating quiver Hecke algebras. We give a basis theorem and a…
We begin with the characterization of quantum graphs as left ideals in $\mathcal M \otimes_{eh} \mathcal M$ (the extended Haagerup tensor product of $\mathcal M$ with itself) to avoid technicalities surrounding representation dependence of…
Using only the combinatorics of its defining ribbon graph, we classify the two-term tilting complexes, as well as their indecomposable summands, of a Brauer graph algebra. As an application, we determine precisely the class of Brauer graph…
Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric…
In this article we describe the centres of all Dyer groups. We also give a complete classification of when a Dyer group $D(\Gamma)$ is hyperbolic or acylindricality hyperbolic, with conditions that can easily be read on the Dyer graph…
Meta-centralizers of non-locally compact group algebras are studied. Theorems about their representations with the help of families of generalized measures are proved. Isomorphisms of group algebras are investigated in relation with…
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is…
We introduce hom-Lie-Rinehart algebras as an algebraic analogue of hom-Lie algebroids, and systematically describe a cohomology complex by considering coefficient modules. We define the notion of extensions for hom-Lie-Rinehart algebras. In…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
We define and study homotopy groups of cubical sets. To this end, we give four definitions of homotopy groups of a cubical set, prove that they are equivalent, and further that they agree with their topological analogues via the geometric…
We study the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theory of graph limits.
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.
The main purpose of this paper is to define representations and a cohomology of color Hom-Lie algebras and to study some key constructions and properties. We describe Hartwig-Larsson-Silvestrov Theorem in the case of $\Gamma$-graded…
In the present paper, complete designs of graphs are considered. The notion of (regular) sampling is introduced and analyzed in detail, showing that the trivial necessary condition for its existence is actually sufficient. Some examples are…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
This manuscript considers the following "graph classification" question: given a collection of graphs and associated classes, how can one predict the class of a newly observed graph? To address this question we propose a statistical model…
In this paper, we study the genera of zero-divisor graphs with respect to ideals in finite rings.
Computer-based attempts to construct lower bounds for small Ramsey numbers are discussed. A systematic review of cyclic Ramsey graphs is attempted. Many known lower bounds are reproduced. Several new bounds are reported.