Around Erdős-Lovász problem on colorings of non-uniform hypergraphs

DOI10.1016/j.disc.2015.04.017zbMath1314.05144OpenAlexW1517654641MaRDI QIDQ2352063

Dmitriy A. Shabanov

Publication date: 29 June 2015

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

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

zbMATH Keywords

colorings of hypergraphsprobabilistic methodsnon-uniform hypergraphsErdős-Lovász problem

Mathematics Subject Classification ID

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

Related Items

Equitable colorings of nonuniform hypergraphs ⋮ A note on two-colorability of nonuniform hypergraphs ⋮ On some generalizations of the property B problem of an \(n\)-uniform hypergraph ⋮ Extremal problems in hypergraph colourings

Cites Work

• Unnamed Item
• Coloring non-uniform hypergraphs without short cycles
• On 3-chromatic hypergraphs
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• Improved bounds and algorithms for hypergraph 2-coloring