Coloring 2-intersecting hypergraphs (Q396868)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6330309
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring 2-intersecting hypergraphs |
scientific article; zbMATH DE number 6330309 |
Statements
Coloring 2-intersecting hypergraphs (English)
0 references
14 August 2014
0 references
Summary: A hypergraph is 2-intersecting if any two edges intersect in at least two vertices. Blais, Weinstein and Yoshida asked (as a first step to a more general problem) whether every 2-intersecting hypergraph has a vertex coloring with a constant number of colors so that each hyperedge has at least \(\min(|e|,3)\) colors. We show that there is such a coloring with at most 5 colors (which is best possible).
0 references
hypergraph coloring
0 references
0.8055562376976013
0 references
0.8013966679573059
0 references
0.7843078374862671
0 references
0.775714635848999
0 references
0.7749820351600647
0 references
