Color-detectors of hypergraphs

• Veröffentlicht in: Algebra and Discrete Mathematics
• Datum: 2005
• Hauptverfasser: Protasov, I.V., Protasova, O.I.
• Format: Artikel
• Sprache: English
• Veröffentlicht: Інститут прикладної математики і механіки НАН України 2005
• Online Zugang: https://nasplib.isofts.kiev.ua/handle/123456789/156597
• Назва журналу: Digital Library of Periodicals of National Academy of Sciences of Ukraine
• Zitieren: Color-detectors of hypergraphs / I.V. Protasov, O.I. Protasova // Algebra and Discrete Mathematics. — 2005. — Vol. 4, № 1. — С. 84–91. — Бібліогр.: 3 назв. — англ.

Let X be a set of cardinality k, F be a family of subsets of X. We say that a cardinal λ,λ<k, is a color-detector of the hypergraph H=(X,F) if card χ(X)≤λ for every coloring χ:X→k such that card χ(F)≤λ for every F∈F. We show that the color-detectors of H are tightly connected with the coverin...