Hom complexes and hypergraph colorings

DOI10.1016/j.topol.2013.05.002zbMath1283.05103OpenAlexW2106105314MaRDI QIDQ390395

Daisuke Kishimoto, Kouyemon Iriye

Publication date: 8 January 2014

Published in: Topology and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.topol.2013.05.002

zbMATH Keywords

uniform hypergraphchromatic numberHom-complex

Mathematics Subject Classification ID

Hypergraphs (05C65) Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Homotopy and Hom construction in the category of finite hypergraphs ⋮ Homomorphism complexes, reconfiguration, and homotopy for directed graphs ⋮ Colorful subhypergraphs in uniform hypergraphs ⋮ Morphism complexes of sets with relations

Cites Work

• A generalized Kneser conjecture
• Kneser's conjecture, chromatic number, and homotopy
• On category, in the sense of Lusternik-Schnirelmann
• Topological lower bounds for the chromatic number: a hierarchy
• Complexes of graph homomorphisms
• Simplicial complexes of graphs
• Simple homotopy types of Hom-complexes, neighborhood complexes, Lovász complexes, and atom crosscut complexes
• Simple proofs of some Borsuk-Ulam results
• The Chromatic Number of Kneser Hypergraphs
• SIMPLE ^|^Sigma;r-HOMOTOPY TYPES OF HOM COMPLEXES AND BOX COMPLEXES ASSIGNED TO r-GRAPHS
• Combinatorial algebraic topology
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler

This page was built for publication: Hom complexes and hypergraph colorings