Randomized algorithms for colourings of hypergraphs

DOI10.1070/SM2008V199N07ABEH003955MaRDI QIDQ4904399zbMATH OpenOpenAlexFDO

Authors D. 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

2-colouring of vertex setproperty B of hypergraphsrandom colouring

Mathematics Subject Classification ID

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

Recommendations

• Extremal problems for colourings of uniform hypergraphs
• On some generalizations of the property B problem of an \(n\)-uniform hypergraph
• Random hypergraphs and property B
• On the vertex number of almost bipartite hypergraphs
• On the chromatic number of a random hypergraph

Cited in

(17)

• New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)
• 2-colorings of hypergraphs with large girth
• Random hypergraphs and property B
• Non-independent randomized rounding and coloring
• On some generalizations of the property B problem of an \(n\)-uniform hypergraph
• scientific article; zbMATH DE number 1688362 (Why is no real title available?)
• Randomized Δ-edge colouring via exchanges of complex colours
• On algorithmic methods of analysis of two-colorings of hypergraphs
• scientific article; zbMATH DE number 5004842 (Why is no real title available?)
• scientific article; zbMATH DE number 11977 (Why is no real title available?)
• scientific article; zbMATH DE number 3435543 (Why is no real title available?)
• On the vertex number of almost bipartite hypergraphs
• scientific article; zbMATH DE number 7368393 (Why is no real title available?)
• Extremal problems in hypergraph colourings
• Extremal problems for colourings of uniform hypergraphs
• On balanced colorings of hypergraphs
• Improved algorithms for colorings of simple hypergraphs and applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904399)