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

There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…

Let C be a clutter and let A be its incidence matrix. If the linear system x>=0;xA<=1 has the integer rounding property, we give a description of the canonical module and the a-invariant of certain normal subrings associated to C. If the…

Regular $A_n$-crystals are certain edge-colored directed graphs which are related to representations of the quantized universal enveloping algebra $U_q(\mathfrak{sl}_{n+1})$. For such a crystal $K$ with colors $1,2,...,n$, we consider its…

Let G(n,d) be the random d-regular graph on n vertices. For any integer k exceeding a certain constant k_0 we identify a number d_{k-col} such that G(n,d) is k-colorable w.h.p. if d<d_{k-col} and non-k-colorable w.h.p. if d>d_{k-col}.

A $k$-edge-colored graph is a finite, simple graph with edges labeled by numbers $1,\ldots,k$. A function from the vertex set of one $k$-edge-colored graph to another is a homomorphism if the endpoints of any edge are mapped to two…

In this paper, we introduce and study families of squarefree monomial ideals called clique ideals and independence ideals that can be associated to a finite graph. A family of clique ideals with linear resolutions has been characterized.…

Let $G$ be a graph and c a proper k-coloring of G, i.e. any two adjacent vertices u and v have different colors c(u) and c(v). A proper k-coloring is a b-coloring if there exists a vertex in every color class that contains all the colors in…

For a graph G, we construct two algebras, whose dimensions are both equal to the number of spanning trees of G. One of these algebras is the quotient of the polynomial ring modulo certain monomial ideal, while the other is the quotient of…

We study the regularity and the projective dimension of the Stanley-Reisner ring of a $k$-decomposable simplicial complex and explain these invariants with a recursive formula. To this aim, the graded Betti numbers of $k$-decomposable…

A cube-like graph is a Cayley graph for the elementary abelian group of order $2^n$. In studies of the chromatic number of cube-like graphs, the $k$th power of the $n$-dimensional hypercube, $Q_n^k$, is frequently considered. This coloring…

Let $k$ be a field and $x,y$ indeterminates over $k$. Let $R=k[x^a,x^{p_1}y^{s_1},\ldots,x^{p_t}y^{s_t},y^b] \subseteq k[x,y]$. We calculate the Hilbert polynomial of $(x^a,y^b)$. The multiplicity of this ideal provides part of a criterion…

For an ideal $I$ in a Noetherian ring $R$, we introduce and study its conductor as a tool to explore the Rees algebra of $I$. The conductor of $I$ is an ideal $C(I)\subset R$ obtained from the defining ideals of the Rees algebra and the…

A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b-chromatic number of a graph $G$ is the largest integer $k$ such that $G$ admits a…

Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…

In this paper uniquely list colorable graphs are studied. A graph G is called to be uniquely k-list colorable if it admits a k-list assignment from which G has a unique list coloring. The minimum k for which G is not uniquely k-list…

Let $G$ be a simple graph and $I(X_G)=\varphi^{-1}(x_i^2-x_j^2 : i,j\in V_G)$, where $\varphi \colon K[E_G]\to K[V_G]$ is the homomorphism that sends an edge to the product of its vertices. The ideal $I(X_G)$ is Cohen--Macaulay,…

Perfect colourings of the rings of cyclotomic integers with class number one are studied. It is shown that all colourings induced by ideals (q) are chirally perfect, and vice versa. A necessary and sufficient condition for a colouring to be…

For each squarefree monomial ideal $I\subset S = k[x_{1},\ldots, x_{n}] $, we associate a simple graph $G_I$ by using the first linear syzygies of $I$. In cases, where $G_I$ is a cycle or a tree, we show the following are equivalent: (a) $…

We investigate the extent to which the $k$-coloring graph $\mathcal{C}_{k}(G)$ uniquely determines the base graph $G$ and the number of colors $k$. The vertices of $\mathcal{C}_{k}(G)$ are the proper $k$-colorings of $G$, and edges connect…

We construct a Cartesian product G x H for finite simple graphs. It satisfies the Kuenneth formula: H^k(G x H) is a direct sum of tensor products H^i(G) x H^j(G) with i+j=k and so p(G x H,x) = p(G,x) p(H,y) for the Poincare polynomial…