Related papers: Universally Koszul algebras defined by graphs

For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…

A diamond is a graph obtained by removing an edge from a complete graph on four vertices. A graph is diamond-free if it does not contain an induced diamond. The Diamond-free Edge Deletion problem asks whether there exist at most $k$ edges…

A graph is called claw-free if it contains no induced subgraph isomorphic to the complete bipartite graph $K_{1, 3}$. The undirected power graph of a group $G$ has vertices the elements of $G$, with an edge between $g_1$ and $g_2$ if one of…

We characterize in terms of a combinatorial condition on the graph $\Gamma$ when the group $\mathrm{PAut}(A_\Gamma)$ of pure symmetric automorphisms of the RAAG $A_\Gamma$ and its outer version $\mathrm{POut}(A_\Gamma)$ have a descending…

A graph is called (claw,diamond)-free if it contains neither a claw (a $K_{1,3}$) nor a diamond (a $K_4$ with an edge removed) as an induced subgraph. Equivalently, (claw,diamond)-free graphs can be characterized as line graphs of…

Let $\lie g$ be a simple Lie algebra and let $\bs^{\lie g}$ be the locally finite part of the algebra of invariants $(_\bc\bv\otimes S(\lie g))^{\lie g}$ where $\bv$ is the direct sum of all simple finite-dimensional modules for $\lie g$…

We elucidate the structure of $(P_6,C_4)$-free graphs by showing that every such graph either has a clique cutset, or a universal vertex, or belongs to several special classes of graphs. Using this result, we show that for any…

A vertex of a graph is bisimplicial if the set of its neighbors is the union of two cliques; a graph is quasi-line if every vertex is bisimplicial. A recent result of Chudnovsky and Seymour asserts that every non-empty even-hole-free graph…

A graph is $H$-free if it does not contain an induced subgraph isomorphic to $H$. For every integer $k$ and every graph $H$, we determine the computational complexity of $k$-Edge Colouring for $H$-free graphs.

A graph {\it has cutwidth at most 2} if one can number its vertices by $1,\ldots n$ so that for every $i=1,\ldots,n-1$ there are at most 2 edges $(u,v)$ such that $u\le i<v$. A characterization of graphs having cutwidth at most 2 in terms…

For every graph $X$, we consider the class of all connected $\{K_{1,3}, X\}$-free graphs which are distinct from an odd cycle and have independence number at least $4$, and we show that all graphs in the class are perfect if and only if $X$…

We discuss certain homological properties of graded algebras whose trivial modules admit non-pure resolutions. Such algebras include both of Artin-Schelter regular algebras of types (12221) and (13431). Under certain conditions, a module…

Under certain conditions, Koszul complexes can be used to calculate relative Betti diagrams of vector space-valued functors indexed by a poset, without the explicit computation of global minimal relative resolutions. In relative homological…

The class of 2K2-free graphs and its various subclasses have been studied in a variety of contexts. In this paper, we are concerned with the colouring of (P3UP2)-free graphs, a super class of 2K2-free graphs. We derive a O(w^3) upper bound…

This is a survey of recently published results. We introduce and study a wide class algebras associated to directed graphs and related to factorizations of noncommutative polynomials. In particular, we show that for many well-known graphs…

This is the second in a series of two papers dealing with $(2P_3,C_4,C_6)$-free graphs, or equivalently, $(2P_3,\text{even hole})$-free graphs. In this two-paper series, we give a full structural description of $(2P_3,C_4,C_6)$-free graphs…

In this article we study the Golod property of standard graded algebras. We show that determinantal ideals, binomial edge ideals, and permanental ideals are Golod if and only if they have a linear resolution. Next, we give a…

We introduce and study the problem of constructing geometric graphs that have few vertices and edges and that are universal for planar graphs or for some sub-class of planar graphs; a geometric graph is \emph{universal} for a class…

To every $C^*$ correspondence over a $C^*$-algebra one can associate a Cuntz-Pimsner algebra generalizing crossed product constructions, graph $C^*$-algebras, and a host of other classes of operator algebras. Cuntz-Pimsner algebras come…

We present a necessary and sufficient condition for a graph of odd-girth $2k+1$ to bound the class of $K_4$-minor-free graphs of odd-girth (at least) $2k+1$, that is, to admit a homomorphism from any such $K_4$-minor-free graph. This yields…