Chromatic polynomials and order ideals of monomials

DOI10.1016/S0012-365X(97)00277-XzbMATH Open0957.05042MaRDI QIDQ1584366FDOQ1584366

Jason I. Brown

Publication date: 2 November 2000

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

Recommendations

• scientific article; zbMATH DE number 927084
• The monomial conjecture and order ideals
• scientific article; zbMATH DE number 4128831
• scientific article
• Chromatic polynomials
• Orderings of monomial ideals
• New expressions for order polynomials and chromatic polynomials
• scientific article; zbMATH DE number 6928912
• scientific article; zbMATH DE number 568845
• scientific article; zbMATH DE number 1822500

zbMATH Keywords

spanning trees[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+basis&go=Go Gr��bner basis]connected graphchromatic polynomialnumber 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)

Cites Work

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

Cited In (14)

• A conjecture on critical graphs and connections to the persistence of associated primes
• A note on the real part of complex chromatic roots
• On the Broken-Circuit Complex of Graphs
• The classification of polynomial orderings on monadic terms
• On the chromatic roots of generalized theta graphs
• Title not available (Why is that?)
• The \(k\)-fractal of a simplicial complex
• Subdivisions and chromatic roots
• On the roots of chromatic polynomials
• Title not available (Why is that?)
• New expressions for order polynomials and chromatic polynomials
• Monomial bases for broken circuit complexes
• Broken circuit complexes of series-parallel networks
• Gale duality bounds for roots of polynomials with nonnegative coefficients

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584366)