Monomial bases for broken circuit complexes

DOI10.1016/j.ejc.2008.12.009zbMath1184.13059arXivmath/0601619OpenAlexW2116830615MaRDI QIDQ1041597

Jason I. Brown, Bruce E. Sagan

Publication date: 3 December 2009

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

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

zbMATH Keywords

broken circuit complexesno broken circuit bases

Mathematics Subject Classification ID

Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Chromatic polynomials and order ideals of monomials
• Acyclic orientations of graphs
• Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph
• The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem
• Hard Enumeration Problems in Geometry and Combinatorics
• The Complexity of Enumeration and Reliability Problems
• Information Bounds Are Weak in the Shortest Distance Problem
• Optimal Randomized Algorithms for Local Sorting and Set-Maxima
• The Upper Bound Conjecture and Cohen-Macaulay Rings
• A logical expansion in mathematics
• Congruent Graphs and the Connectivity of Graphs
• On the computational complexity of the Jones and Tutte polynomials
• Cohen–Macaulay Rings in Network Reliability
• Lower Bounds forh-Vectors ofk-CM, Independence, and Broken Circuit Complexes

This page was built for publication: Monomial bases for broken circuit complexes