Randomized algorithms for colourings of hypergraphs

DOI10.1070/SM2008v199n07ABEH003955zbMath1257.05046OpenAlexW2088042372MaRDI QIDQ4904399

Dmitriy A. Shabanov

Publication date: 29 January 2013

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

Full work available at URL: https://doi.org/10.1070/sm2008v199n07abeh003955

zbMATH Keywords

random colouring2-colouring of vertex setproperty B of hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (6)

On algorithmic methods of analysis of two-colorings of hypergraphs ⋮ On some generalizations of the property B problem of an \(n\)-uniform hypergraph ⋮ 2-colorings of hypergraphs with large girth ⋮ Extremal problems in hypergraph colourings ⋮ On balanced colorings of hypergraphs ⋮ New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)

This page was built for publication: Randomized algorithms for colourings of hypergraphs