Part of the Lecture Notes in Mathematics book series (LNM, volume 1928)
We discuss simplicial complexes of matchings.Recall that a matching is a graph in which each vertex is adjacent to at most one other vertex.
KeywordsExact Sequence Nonzero Element Complete Graph Simplicial Complex Homology Group
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 2008