شماره ركورد كنفرانس :
4062
عنوان مقاله :
ON COHEN-MACAULAYNESS OF HYPERGRAPH COLORING COMPLEXES
پديدآورندگان :
SAKI AMIR amir.saki.math@gmail.com Amirkabir University of Technology , KIANI DARIUSH dkiani@aut.ac.ir Amirkabir University of Technology
كليدواژه :
Cohen , Macaulay , hypergraph , shellability , simplicial complex .
عنوان كنفرانس :
نهمين كنفرانس ملي نظريه گراف و تركيبيات جبري
چكيده فارسي :
In this paper, we prove that the coloring complex of a complete r-uniform
r-partite hypergraph is shellable, if and only if there exists a vertex v of H with v 2 e,
for every edge e of H. In continuing, we show that for a class of hypergraphs H, the
coloring complex is not Cohen-Macaulay.
