Color-detectors of hypergraphs
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...
Saved in:
| Date: | 2005 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2005
|
| Series: | Algebra and Discrete Mathematics |
| Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/156597 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | Color-detectors of hypergraphs / I.V. Protasov, O.I. Protasova // Algebra and Discrete Mathematics. — 2005. — Vol. 4, № 1. — С. 84–91. — Бібліогр.: 3 назв. — англ. |