Chromatic polynomials and order ideals of monomials

DOI10.1016/S0012-365X(97)00277-XzbMath0957.05042MaRDI QIDQ1584366

Jason I. Brown

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Gröbner basischromatic polynomialconnected graphspanning treesnumber of monomialscircuit complex

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

The \(k\)-fractal of a simplicial complex ⋮ A note on the real part of complex chromatic roots ⋮ Broken circuit complexes of series-parallel networks ⋮ On the Broken-Circuit Complex of Graphs ⋮ A conjecture on critical graphs and connections to the persistence of associated primes ⋮ On the roots of chromatic polynomials ⋮ Monomial bases for broken circuit complexes ⋮ On the chromatic roots of generalized theta graphs ⋮ Subdivisions and chromatic roots

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• What can be said about pure O-sequences?
• On the Eneström-Kakeya theorem and its sharpness
• Chromatic roots - some observations and conjectures
• Chromatic polynomials for regular graphs and modified wheels
• The broken-circuit complex: its structure and factorizations
• An inequality for chromatic polynomials
• Face number inequalities for matroid complexes and Cohen-Macaulay types of Stanley-Reisner rings of distributive lattices
• A method and two algorithms on the theory of partitions
• Cohen-Macaulay connectivity and geometric lattices
• Non-Stanley bounds for network reliability
• Chromatic polynomials and logarithmic concavity
• On Crapo's Beta Invariant for Matroids
• Roots of the Reliability Polynomials
• The Broken-Circuit Complex
• Balanced Cohen-Macaulay Complexes
• A Zero-Free Interval for Chromatic Polynomials of Graphs
• Location of Zeros of Chromatic and Related Polynomials of Graphs
• The Computational Complexity of the Tutte Plane: the Bipartite Case
• Bounds on the Reliability Polynomial for Shellable Independence Systems
• Cohen–Macaulay Rings in Network Reliability
• A higher invariant for matroids
• The golden root of a chromatic polynomial
• A Combinatorial Model for Series-Parallel Networks

This page was built for publication: Chromatic polynomials and order ideals of monomials