Показати простий запис статті
dc.contributor.author |
Protasov, I.V. |
|
dc.contributor.author |
Protasova, O.I. |
|
dc.date.accessioned |
2019-06-18T17:33:49Z |
|
dc.date.available |
2019-06-18T17:33:49Z |
|
dc.date.issued |
2005 |
|
dc.identifier.citation |
Color-detectors of hypergraphs / I.V. Protasov, O.I. Protasova // Algebra and Discrete Mathematics. — 2005. — Vol. 4, № 1. — С. 84–91. — Бібліогр.: 3 назв. — англ. |
uk_UA |
dc.identifier.issn |
1726-3255 |
|
dc.identifier.other |
2000 Mathematics Subject Classification: 05C15. |
|
dc.identifier.uri |
http://dspace.nbuv.gov.ua/handle/123456789/156597 |
|
dc.description.abstract |
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 covering number cov(H)=sup{α: any α points of X are contained in some F∈F}. In some cases we determine all of the color-detectors of H and their asymptotic counterparts. We put also some open questions. |
uk_UA |
dc.language.iso |
en |
uk_UA |
dc.publisher |
Інститут прикладної математики і механіки НАН України |
uk_UA |
dc.relation.ispartof |
Algebra and Discrete Mathematics |
|
dc.title |
Color-detectors of hypergraphs |
uk_UA |
dc.type |
Article |
uk_UA |
dc.status |
published earlier |
uk_UA |
Файли у цій статті
Ця стаття з'являється у наступних колекціях
Показати простий запис статті