Colorings of hypergraphs with large number of colors

DOI10.1016/j.disc.2016.06.016zbMath1343.05057OpenAlexW2439149277MaRDI QIDQ5895162

Ilia Akolzin, Dmitriy A. Shabanov

Publication date: 16 August 2016

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

Full work available at URL: https://doi.org/10.1016/j.disc.2016.06.016

zbMATH Keywords

colorings of hypergraphsTurán numbersproperty B problem

Mathematics Subject Classification ID

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

Related Items (12)

A General Framework for Hypergraph Coloring ⋮ Equitable colorings of hypergraphs with \(r\) colors ⋮ On some generalizations of the property B problem of an \(n\)-uniform hypergraph ⋮ Random constructions of hypergraphs with large girth and without panchromatic colorings ⋮ Colorings of \(b\)-simple hypergraphs ⋮ The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets ⋮ Extremal problems in hypergraph colourings ⋮ On colorings of 3-homogeneous hypergraphs in 3 colors ⋮ Regular Behavior of the Maximal Hypergraph Chromatic Number ⋮ On the Erdős-Hajnal problem for 3-graphs ⋮ Coloring hypergraphs with bounded cardinalities of edge intersections ⋮ Equitable colorings of hypergraphs with few edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(r\)-chromatic hypergraphs
• Lower bounds for Turán's problem
• Hypergraphs with high chromatic number
• A remark concerning arithmetic progressions
• Greedy colorings of uniform hypergraphs
• Constructions of sparse uniform hypergraphs with high chromatic number
• 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
• On a combinatorial problem. II
• Upper bounds for Turán numbers

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