Hom complexes and hypergraph colorings

Kouyemon Iriye, Daisuke Kishimoto

Research output: Contribution to journalArticlepeer-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 languageEnglish
Pages (from-to)1333-1344
Number of pages12
JournalTopology and its Applications
Volume160
Issue number12
DOIs
Publication statusPublished - Aug 1 2013
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Geometry and Topology

Fingerprint

Dive into the research topics of 'Hom complexes and hypergraph colorings'. Together they form a unique fingerprint.

Cite this