The coloring ideal and coloring complex of a graph

DOI10.1023/A:1011222121664zbMath0986.05044arXivmath/0104063OpenAlexW1719679702MaRDI QIDQ5949016

Einar Steingrímsson

Publication date: 3 June 2002

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0104063

zbMATH Keywords

monomial idealStanley-Reisner ringEuler characteristicsimplicial complexHilbert polynomialchromatic polynomialacyclic orientation

Mathematics Subject Classification ID

Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40) Coloring of graphs and hypergraphs (05C15)

Related Items (20)

Link complexes of subspace arrangements ⋮ Hyperoctahedral Eulerian idempotents, Hodge decompositions, and signed graph coloring complexes ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ Chromatic quasisymmetric class functions of linearized combinatorial Hopf monoids ⋮ The coloring complex and cyclic coloring complex of a complete \(k\)-uniform hypergraph ⋮ Scheduling problems ⋮ On Cohen-Macaulay Hopf monoids in species ⋮ Bounds on the coefficients of tension and flow polynomials ⋮ Hypergraph coloring complexes ⋮ The Hodge structure of the coloring complex of a hypergraph ⋮ A Hodge decomposition interpretation for the coefficients of the chromatic polynomial ⋮ Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs ⋮ Coloring complexes and arrangements ⋮ A conjecture on critical graphs and connections to the persistence of associated primes ⋮ The topology of the coloring complex ⋮ Functions of random walks on hyperplane arrangements ⋮ Existence of unimodular triangulations — positive results ⋮ The homology of the cyclic coloring complex of simple graphs ⋮ Enumerating colorings, tensions and flows in cell complexes ⋮ Coloring complexes and combinatorial Hopf monoids

Uses Software

• Macaulay2

Cites Work

• Hilbert polynomials in combinatorics
• A symmetric function generalization of the chromatic polynomial of a graph
• Combinatorics and commutative algebra.
• On the cover polynomial of a digraph
• The path-cycle symmetric function of a digraph
• Descents, quasi-symmetric functions, Robinson-Schensted for posets, and the chromatic symmetric function
• Acyclic orientations of graphs
• Expansions of Chromatic Polynomials and Log-Concavity

This page was built for publication: The coloring ideal and coloring complex of a graph