The coloring complex and cyclic coloring complex of a complete k-uniform hypergraph

DOI10.1016/J.JCTA.2012.02.001zbMATH Open1239.05073arXiv1110.5007OpenAlexW2001907205MaRDI QIDQ412193FDOQ412193

Authors: Sarah Crown Rundell 

Publication date: 4 May 2012

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: In this paper, we study the homology of the coloring complex and the cyclic coloring complex of a complete $k$-uniform hypergraph. We show that the coloring complex of a complete $k$-uniform hypergraph is shellable, and we determine the rank of its unique nontrivial homology group in terms of its chromatic polynomial. We also show that the dimension of the $(n-k-1{)}^{st}$ homology group of the cyclic coloring complex of a complete $k$-uniform hypergraph is given by a binomial coefficient. Further, we discuss a complex whose $r$-faces consist of all ordered set partitions $[B_1,hdots,B_{r+2}]$ where none of the $B_i$ contain a hyperedge of the complete $k$-uniform hypergraph $H$ and where $1in{B}_1$. It is shown that the dimensions of the homology groups of this complex are given by binomial coefficients. As a consequence, this result gives the dimensions of the multilinear parts of the cyclic homology groups of $$ is a hyperedge of $$.

Full work available at URL: https://arxiv.org/abs/1110.5007

Recommendations

• The homology of the cyclic coloring complex of simple graphs
• Coloring \(d\)-embeddable \(k\)-uniform hypergraphs
• Coloring \(d\)-embeddable \(k\)-uniform hypergraphs
• Kneser colorings of uniform hypergraphs
• Complete colourings of hypergraphs
• The coloring ideal and coloring complex of a graph
• Hom complexes and hypergraph colorings
• The Hodge structure of the coloring complex of a hypergraph
• Complexes oft-Colorable Graphs
• The coloring graph of complete graphs

zbMATH Keywords

coloring complexcomplete \(k\)-uniform hypergraphcyclic coloring complex

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Shellable Nonpure Complexes and Posets. I
• Title not available (Why is that?)
• The homology of the cyclic coloring complex of simple graphs
• Hypergraph coloring complexes
• The Hodge structure of the coloring complex of a hypergraph
• The topology of the coloring complex
• A Hodge decomposition interpretation for the coefficients of the chromatic polynomial
• The coloring ideal and coloring complex of a graph
• Link complexes of subspace arrangements

Cited In (3)

• Hypergraph coloring complexes
• Hyperoctahedral Eulerian idempotents, Hodge decompositions, and signed graph coloring complexes
• The homology of the cyclic coloring complex of simple graphs

This page was built for publication: The coloring complex and cyclic coloring complex of a complete \(k\)-uniform hypergraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412193)