Improvement of the lower bound in the Kostochka problem of panchromatic coloring of a hypergraph

DOI10.1134/S0001434611050324zbMath1267.05124OpenAlexW2010211834MaRDI QIDQ650517

A. P. Rozovskaya, Dmitriy A. Shabanov

Publication date: 25 November 2011

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434611050324

zbMATH Keywords

upper and lower bounds\(n\)-uniform hypergraphpanchromatic \(r\)-coloring

Mathematics Subject Classification ID

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

Related Items (1)

A note on panchromatic colorings

Cites Work

• Unnamed Item
• Improved bounds and algorithms for hypergraph 2-coloring
• On a property of families of sets
• On a combinatorial problem. II

This page was built for publication: Improvement of the lower bound in the Kostochka problem of panchromatic coloring of a hypergraph