Coloring 2-intersecting hypergraphs

Lucas Colucci, András Gyárfás

Research output: Contribution to journalArticle


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).

Original languageEnglish
JournalElectronic Journal of Combinatorics
Issue number3
Publication statusPublished - Sep 13 2013


ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this