Coloring 2-intersecting hypergraphs
Combinatorics
2020-06-12 v1
Abstract
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 e has at least min{|e|,3} colors. We show that there is such a coloring with at most 5 colors (which is best possible).
Cite
@article{arxiv.1307.6944,
title = {Coloring 2-intersecting hypergraphs},
author = {Lucas Colucci and András Gyárfás},
journal= {arXiv preprint arXiv:1307.6944},
year = {2020}
}