Related papers: The Coloring Ideal and Coloring Complex of a Graph

Let $H=(V(H),E(H))$ be a graph. A $k$-coloring of $H$ is a mapping $\pi : V(H) \longrightarrow \{1,2,\ldots, k\}$ so that each color class induces a $K_2$-free subgraph. For a graph $G$ of order at least $2$, a $G$-free $k$-coloring of $H$…

Let $A = K[x_1, ..., x_n]$ denote the polynomial ring in $n$ variables over a field $K$ of characteristic 0 with each $\deg x_i = 1$. Given arbitrary integers $i$ and $j$ with $2 \leq i \leq n$ and $3 \leq j \leq n$, we will construct a…

Let $K$ be an infinite field and let $m_1,\ldots,m_n$ be a generalized arithmetic sequence of positive integers, i.e., there exist $h, d, m_1 \in\mathbb{Z}^+$ such that $m_i = h m_1 + (i-1)d$ for all $i \in \{2,\ldots,n\}$. We consider the…

Motivated by the definition of linear coloring on simplicial complexes, recently introduced in the context of algebraic topology \cite{Civan}, and the framework through which it was studied, we introduce the linear coloring on graphs. We…

Let R be a Stanley-Reisner ring (that is, a reduced monomial ring) with coefficients in a domain k, and K its associated simplicial complex. Also let D_k(R) be the ring of k-linear differential operators on R. We give two different…

Krenn, Gu and Zeilinger initiated the study of PMValid edge-colourings because of its connection to a problem from quantum physics. A graph is defined to have a PMValid $k$-edge-colouring if it admits a $k$-edge-colouring (i.e. an edge…

Our main theorems provide a single geometric setting in which polynomial representatives for Schubert classes in the integral cohomology ring of the flag manifold are determined uniquely, and have positive coefficients for geometric…

A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most 1. The equitable chromatic threshold of a graph $G$, denoted by $\chi_=^*(G)$, is the minimum $k$ such that $G$ is equitably…

We construct an explicit basis for the coordinate ring of the Bott-Samelson variety Z_i associated to G = GL(n) and an arbitrary sequence of simple reflections i. Our basis is parametrized by certain standard tableaux and generalizes the…

A ring is a graph $R$ whose vertex set can be partitioned into $k \geq 4$ nonempty sets, $X_1, \dots, X_k$, such that for all $i \in \{1,\dots,k\}$, the set $X_i$ can be ordered as $X_i = \{u_i^1, \dots, u_i^{|X_i|}\}$ so that $X_i…

A spline is an assignment of polynomials to the vertices of a graph whose edges are labeled by ideals, where the difference of two polynomials labeling adjacent vertices must belong to the corresponding ideal. The set of splines forms a…

Let $\Phi(x,y)\in\mathbb{C}[x,y]$ be a symmetric polynomial of partial degree $d$. The graph $G(\Phi)$ is defined by taking $\mathbb{C}$ as set of vertices and the points of $\mathbb{V}(\Phi(x,y))$ as edges. We study the following problem:…

Let $G=(V,E)$ be a finite simple graph. In this paper, we study the degree of the $h$-polynomial of the edge ideal of $G$ in relation to the independence number of $G$. Our approach is based on the value of the independence polynomial of…

The essential annihilating-ideal graph $\mathcal{EG}(R)$ of a commutative unital ring $R$ is a simple graph whose vertices are non-zero ideals of $R$ with non-zero annihilator and there exists an edge between two distinct vertices $I,J$ if…

Let $K$ be a field and $I$ a monomial ideal of the polynomial ring $S=K[x_1,\ldots, x_n]$. We show that if either: 1) $I$ is almost complete intersection, 2) $I$ can be generated by less than four monomials; or 3) $I$ is the Stanley-Reisner…

Given a finite simple graph G=(V,E) with chromatic number c and chromatic polynomial C(x). Every vertex graph coloring f of G defines an index i_f(x) satisfying the Poincare-Hopf theorem sum_x i_f(x)=chi(G). As a variant to the index…

Let $K[HK_{\Theta}]$ denote the Hecke-Kiselman algebra of a finite oriented graph $\Theta$ over an algebraically closed field $K$. All irreducible representations, and the corresponding maximal ideals of $K[HK_{\Theta}]$, are characterized…

We study the properties of the rook complex $\mathcal{R}$ of a polyomino $\mathcal{P}$ seen as independence complex of a graph $G$, and the associated Stanley--Reisner ideal $I_\mathcal{R}$. In particular, we characterize the polyominoes…

Let $G$ be a finite simple graph on $n$ vertices and $J_G$ denote the corresponding binomial edge ideal in the polynomial ring $S = K[x_1, \ldots, x_n, y_1, \ldots, y_n].$ In this article, we compute the Hilbert series of binomial edge…

For $t\geq 2$, the $t$-independence complex $\mathrm{Ind}_t(G)$ of a graph $G$ is the collection of all $A\subseteq V(G)$ such that each connected component of the induced subgraph $G[A]$ has at most $t-1$ vertices. The topology of…