Hom complexes and hypergraph colorings

Kouyemon Iriye; Daisuke Kishimoto

doi:10.1016/j.topol.2013.05.002

Hom complexes and hypergraph colorings

Kouyemon Iriye, Daisuke Kishimoto

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

Babson and Kozlov (2006) [2] studied Hom-complexes of graphs with a focus on graph colorings. In this paper, we generalize Hom-complexes to r-uniform hypergraphs (with multiplicities) and study them mainly in connection with hypergraph colorings. We reinterpret a result of Alon, Frankl and Lovász (1986) [1] by Hom-complexes and show a hierarchy of known lower bounds for the chromatic numbers of r-uniform hypergraphs (with multiplicities) using Hom-complexes.

Original language	English
Pages (from-to)	1333-1344
Number of pages	12
Journal	Topology and its Applications
Volume	160
Issue number	12
DOIs	https://doi.org/10.1016/j.topol.2013.05.002
Publication status	Published - Aug 1 2013
Externally published	Yes

All Science Journal Classification (ASJC) codes

Geometry and Topology

Access to Document

10.1016/j.topol.2013.05.002

Cite this

@article{1ae0d481bff44eafa1ddee9b802e298a,

title = "Hom complexes and hypergraph colorings",

abstract = "Babson and Kozlov (2006) [2] studied Hom-complexes of graphs with a focus on graph colorings. In this paper, we generalize Hom-complexes to r-uniform hypergraphs (with multiplicities) and study them mainly in connection with hypergraph colorings. We reinterpret a result of Alon, Frankl and Lov{\'a}sz (1986) [1] by Hom-complexes and show a hierarchy of known lower bounds for the chromatic numbers of r-uniform hypergraphs (with multiplicities) using Hom-complexes.",

author = "Kouyemon Iriye and Daisuke Kishimoto",

year = "2013",

month = aug,

day = "1",

doi = "10.1016/j.topol.2013.05.002",

language = "English",

volume = "160",

pages = "1333--1344",

journal = "Topology and its Applications",

issn = "0166-8641",

publisher = "Elsevier",

number = "12",

}

TY - JOUR

T1 - Hom complexes and hypergraph colorings

AU - Iriye, Kouyemon

AU - Kishimoto, Daisuke

PY - 2013/8/1

Y1 - 2013/8/1

N2 - Babson and Kozlov (2006) [2] studied Hom-complexes of graphs with a focus on graph colorings. In this paper, we generalize Hom-complexes to r-uniform hypergraphs (with multiplicities) and study them mainly in connection with hypergraph colorings. We reinterpret a result of Alon, Frankl and Lovász (1986) [1] by Hom-complexes and show a hierarchy of known lower bounds for the chromatic numbers of r-uniform hypergraphs (with multiplicities) using Hom-complexes.

AB - Babson and Kozlov (2006) [2] studied Hom-complexes of graphs with a focus on graph colorings. In this paper, we generalize Hom-complexes to r-uniform hypergraphs (with multiplicities) and study them mainly in connection with hypergraph colorings. We reinterpret a result of Alon, Frankl and Lovász (1986) [1] by Hom-complexes and show a hierarchy of known lower bounds for the chromatic numbers of r-uniform hypergraphs (with multiplicities) using Hom-complexes.

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

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

U2 - 10.1016/j.topol.2013.05.002

DO - 10.1016/j.topol.2013.05.002

M3 - Article

AN - SCOPUS:84879889733

VL - 160

SP - 1333

EP - 1344

JO - Topology and its Applications

JF - Topology and its Applications

SN - 0166-8641

IS - 12

ER -

Hom complexes and hypergraph colorings

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this