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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Matchings. In: Simplicial Complexes of Graphs. Lecture Notes in Mathematics, vol 1928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75859-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-75859-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75858-7
Online ISBN: 978-3-540-75859-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)