2-colorability of \(r\)-uniform hypergraphs

zbMath1418.05066MaRDI QIDQ2318778

Lubos Thoma, Michael Krul

Publication date: 16 August 2019

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

Full work available at URL: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i3p30

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

An algebraic formulation of hypergraph colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Colorings and orientations of graphs
• Stable sets and polynomials
• Gröbner bases and graph colorings
• Recognizing graph theoretic properties with polynomial ideals
• Algebraic characterization of uniquely vertex colorable graphs
• Conflict-Free Colourings of Uniform Hypergraphs With Few Edges
• 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
• A Note on a Combinatorial Problem of ErdŐS and Hajnal

This page was built for publication: 2-colorability of \(r\)-uniform hypergraphs