Coloring 2-intersecting hypergraphs

Lucas Colucci, A. Gyárfás

Research output: Contribution to journalArticle

Abstract

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
Volume20
Issue number3
Publication statusPublished - Sep 13 2013

Fingerprint

Coloring
Hypergraph
Colouring
Color
Vertex Coloring
Intersect

ASJC Scopus subject areas

  • Geometry and Topology
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Coloring 2-intersecting hypergraphs. / Colucci, Lucas; Gyárfás, A.

In: Electronic Journal of Combinatorics, Vol. 20, No. 3, 13.09.2013.

Research output: Contribution to journalArticle

@article{3d3d27d32cec48619548841ad23cd6dc,
title = "Coloring 2-intersecting hypergraphs",
abstract = "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).",
author = "Lucas Colucci and A. Gy{\'a}rf{\'a}s",
year = "2013",
month = "9",
day = "13",
language = "English",
volume = "20",
journal = "Electronic Journal of Combinatorics",
issn = "1077-8926",
publisher = "Electronic Journal of Combinatorics",
number = "3",

}

TY - JOUR

T1 - Coloring 2-intersecting hypergraphs

AU - Colucci, Lucas

AU - Gyárfás, A.

PY - 2013/9/13

Y1 - 2013/9/13

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

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

UR - http://www.scopus.com/inward/record.url?scp=84884407073&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84884407073&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84884407073

VL - 20

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

SN - 1077-8926

IS - 3

ER -