Color-detectors of hypergraphs
Let \(X\) be a set of cardinality \(k\), \(\mathcal{F}\) be a family of subsets of \(X\). We say that a cardinal \(\lambda, \lambda< k\), is a color-detector of the hypergraph \(H=(X, \mathcal{F})\) if card \(\chi(X)\leq \lambda\) for every coloring \(\chi: X\rightarrow k\) such that card ...
Saved in:
| Date: | 2018 |
|---|---|
| Main Authors: | Protasov, I. V., Protasova, O. I. |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2018
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/918 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete MathematicsSimilar Items
-
Color-detectors of hypergraphs
by: Protasov, I.V., et al.
Published: (2005) -
On one-sided interval edge colorings of biregular bipartite graphs
by: Kamalian, Rafayel Ruben
Published: (2015) -
On one-sided interval edge colorings of biregular bipartite graphs
by: Kamalian, Rafayel Ruben
Published: (2015) -
On n-stars in colorings and orientations of graphs
by: Protasov, Igor Vladimirovich
Published: (2016) -
On n-stars in colorings and orientations of graphs
by: Protasov, Igor Vladimirovich
Published: (2016)