Related papers: The Graded Classification Conjecture holds for gra…

Fix a noetherian scheme S. For any flat map f: X->Y of separated essentially-finite-type perfect S-schemes we define a canonical derived-category map c(f):\H(X)->f^!\H(Y), the fundamental class of f, where \H(Z) is the (pre-)Hochschild…

A connected graph $G$ with chromatic number $t$ is double-critical if $G \backslash \{x, y\}$ is $(t - 2)$-colorable for each edge $xy \in E(G)$. The complete graphs are the only known examples of double-critical graphs. A long-standing…

We prove a Lefschetz formula for general simple graphs which equates the Lefschetz number L(T) of an endomorphism T with the sum of the degrees i(x) of simplices in G which are fixed by T. The degree i(x) of x with respect to T is defined…

This article deals with homomorphisms of oriented graphs with respect to push equivalence. Here homomorphisms refer to arc preserving vertex mappings, and push equivalence refers to the equivalence class of orientations of a graph $G$ those…

For an $n$-vertex graph $G$, let $z(G;k)$ denote the number of zero forcing sets of size $k$. A conjecture of Boyer et al. asserts that the path $P_n$ maximizes these numbers coefficientwise among all $n$-vertex graphs; equivalently, the…

Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if, and only if, they are homomorphism indistinguishable over all graphs, i.e., $G$ and $H$ admit the same number of number of homomorphisms from every graph $F$.…

We give a direct proof that the proalgebraic graded Grothendieck-Teichm\"uller group $\mathsf{GRT}_{\mathbb{K}}$ is isomorphic to the group of automorphisms of the prounipotent cyclic operad of parenthesized ribbon chord diagrams based on…

We study the deformation complex of a canonical morphism $i$ from the properad of (degree shifted) Lie bialgebras $\mathbf{Lieb}_{c,d}$ to its polydifferential version $\mathcal{D}(\mathbf{Lieb}_{c,d})$ and show that it is quasi-isomorphic…

Let $G$ be a finite group of Lie type. In studying the cross-characteristic representation theory of $G$, the (specialized) Hecke algebra $H=\End_G(\ind_B^G1_B)$ has played a important role. In particular, when $G=GL_n(\mathbb F_q)$ is a…

We show that, for an arbitrary graph, a regular ideal of the associated Leavitt path algebra is also graded. As a consequence, for a row-finite graph, we obtain that the quotient of the associated Leavitt path by a regular ideal is again a…

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

A connected graph $G$, of order two or more, is matching covered if each edge lies in some \pema. The tight cut decomposition of a matching covered graph $G$ yields a list of bricks and braces; as per a theorem of Lov{\'a}sz~\cite{lova87},…

In this paper we study a filtered "K-theoretical" analog of a graded algebra associated to any loopless graph G which was introduced in \cite{PS}. We show that two such filtered algebras are isomorphic if and only if their graphs are…

Associating graph algebras to directed graphs leads to both covariant and contravariant functors from suitable categories of graphs to the category k-Alg of algebras and algebra homomorphisms. As both functors are often used at the same…

We appeal to results from combinatorial random matrix theory to deduce that various random graph $\mathrm{C}^*$-algebras are asymptotically almost surely Kirchberg algebras with trivial $K_1$. This in particular implies that, with high…

It is conjectured by Chen and Raspaud that for each integer $k \ge 2$, any graph $G$ with \[ \mathrm{mad}(G) < \frac{2k+1}{k} \quad\text{and}\quad \mathrm{odd\text{-}girth}(G) \ge 2k+1 \] admits a homomorphism into the Kneser graph…

To each finitely aligned higher-rank graph $\Lambda$ and each $\mathbb{T}$-valued 2-cocycle on $\Lambda$, we associate a family of twisted relative Cuntz-Krieger algebras. We show that each of these algebras carries a gauge action, and…

A graph $G$ of order $2n$ is called degree-equipartite if for every $n$-element set $A\subseteq V(G)$, the degree sequences of the induced subgraphs $G[A]$ and $G[V(G)\setminus A]$ are the same. In this paper, we characterize all…

In this paper we investigate the connectedness and the isomorphism problems for zig-zag products of two graphs. A sufficient condition for the zig-zag product of two graphs to be connected is provided, reducing to the study of the…

Given a finite simple undirected graph $G$, let $T_1(G)$ denote the subset of vertices of $G$ such that every vertex of $T_1(G)$ belongs to at least one subgraph isomorphic to a graph obtained by connecting a single vertex to two vertices…