Cargando…
Hypergraph coloring complexes
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes–a purely combinatorial one and two geometric ones. It is shown, that most of the properties, which are known to be true for coloring comp...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Elsevier
2012
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3587399/ https://www.ncbi.nlm.nih.gov/pubmed/23483700 http://dx.doi.org/10.1016/j.disc.2012.04.027 |