On algorithmic methods of analysis of two-colorings of hypergraphs

DOI10.1007/s10958-016-2711-7zbMath1337.05044OpenAlexW2297336610MaRDI QIDQ291223

A. V. Lebedeva

Publication date: 7 June 2016

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-016-2711-7

zbMATH Keywords

hypergraph colorings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• On balanced colorings of hypergraphs
• Upper bound in the Erdős-Hajnal problem of hypergraph coloring
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• Randomized algorithms for colourings of hypergraphs
• On a Combinatorial Problem of Erdös and Hajnal
• Extremal problems for colourings of uniform hypergraphs
• On A Combinatorial Problem of Erdös
• On a property of families of sets

This page was built for publication: On algorithmic methods of analysis of two-colorings of hypergraphs