An algebraic formulation of hypergraph colorings

DOI10.37236/9894zbMath1529.05070OpenAlexW4380987880MaRDI QIDQ6106296

Lubos Thoma, Michael Krul

Publication date: 27 June 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/9894

zbMATH Keywords

Gröbner basesalgebraic algorithm

Mathematics Subject Classification ID

Hypergraphs (05C65) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On variants of conflict-free-coloring for hypergraphs
• Color-bounded hypergraphs. I: General results
• Colorings and orientations of graphs
• Stable sets and polynomials
• Coloring mixed hypergraphs: theory, algorithms and applications
• Gröbner bases and graph colorings
• Recognizing graph theoretic properties with polynomial ideals
• 2-colorability of \(r\)-uniform hypergraphs
• Pattern hypergraphs
• Algebraic characterization of uniquely vertex colorable graphs
• Graph Theory
• Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz
• Combinatorial Nullstellensatz
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Powers of Square-Free Monomial Ideals and Combinatorics
• Mixed hypergraphs and beyond
• Coloring Geometric Range Spaces

This page was built for publication: An algebraic formulation of hypergraph colorings