Colorings of hypergraphs with large number of colors

DOI10.1016/J.ENDM.2015.06.057zbMath1346.05054OpenAlexW2174335336MaRDI QIDQ5890912

Ilia Akolzin, Dmitriy A. Shabanov

Publication date: 14 October 2016

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.057

zbMATH Keywords

colorings of hypergraphsTurán numberproperty B problem

Mathematics Subject Classification ID

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

Cites Work

• Hypergraphs with high chromatic number
• Greedy colorings of uniform hypergraphs
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• A note on random greedy coloring of uniform hypergraphs
• Improved bounds and algorithms for hypergraph 2-coloring
• On a property of families of sets
• Upper bounds for Turán numbers

This page was built for publication: Colorings of hypergraphs with large number of colors