Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/148
Title: | Color-detectors of hypergraphs |
Other Titles: | Dedicated to Yu.A. Drozd on the occasion of his 60th birthday |
Authors: | Protasov, I. V. Protasova, O. I. |
Keywords: | алгебра дискретная математика |
Issue Date: | 2005 |
Publisher: | Луганский национальный университет им. Т. Шевченко |
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 2 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 2 F}. In some cases we determine all of the color-detectors of H and their asymptotic counterparts. We put also some open questions. |
URI: | http://hdl.handle.net/123456789/148 |
Appears in Collections: | Статті |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
adm-n1-7.pdf | 151.44 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.