Monomial invariants applied to graph coloring

DOI10.1007/s10801-023-01235-5zbMath1529.05056arXiv1910.04896OpenAlexW2979641217MaRDI QIDQ6116562

Guillermo Alesandroni

Publication date: 18 July 2023

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

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

zbMATH Keywords

multiplicityprojective dimensioncodimensionchromatic numberchromatic polynomialmonomial ideals

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) General commutative ring theory and combinatorics (zero-divisor graphs, annihilating-ideal graphs, etc.) (13A70)

Cites Work

• Unnamed Item
• Minimal resolutions of dominant and semidominant ideals
• Graded syzygies
• Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals
• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
• On the combinatorial problems which I would most like to see solved
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
• On a Conjecture of Erdös, Faber, and Lovász about n-Colorings
• Monomial multiplicities in explicit form
• A Beginner’s Guide to Edge and Cover Ideals

This page was built for publication: Monomial invariants applied to graph coloring