Abstract
A matching complex of a simple graph G is a simplicial complex with faces given by the matchings of G. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa showed that matching complexes of forests are contractible or homotopy equivalent to a wedge of spheres. We study two specific families of trees. For caterpillar graphs, we give explicit formulas for the number of spheres in each dimension and for perfect binary trees we find a strict connectivity bound. We also use a tool from discrete Morse theory called the Matching Tree Algorithm to study the connectivity of honeycomb graphs, partially answering a question raised by Jonsson.
Similar content being viewed by others
Notes
For this configuration, the choice of splitting vertex does not affect the size or quantity of critical cells, but this is not true for all configurations.
References
Michal Adamaszek. Splittings of independence complexes and the powers of cycles. J. Combin. Theory Ser. A, 119(5):1031–1047, 2012.
Jonathan Ariel Barmak. Star clusters in independence complexes of graphs. Adv. Math., 241:33–57, 2013.
Margaret Bayer, Bennet Goeckner, and Marija Jelić Milutinović. Manifold Matching Complexes. Mathematika, 66(4):973–1002, 2020.
Anders Bjorner, László Lovász, Sinisa T Vrecica, and Rade T Zivaljevic. Chessboard complexes and matching complexes. J. London Math. Soc. (2), 49(1):25–39, 1994.
Anders Björner, Michelle Wachs, and Volkmar Welker. Poset fiber theorems. Transactions of the American Mathematical Society, 357(5):1877–1899, 2005.
S. Bouc. Homologie de certains ensembles de \(2\)-sous-groupes des groupes symétriques. J. Algebra, 150(1):158–186, 1992.
Mireille Bousquet-Mélou, Svante Linusson, and Eran Nevo. On the independence complex of square grids. J. Algebraic Combin., 27(4):423–450, 2008.
Benjamin Braun. Independence complexes of stable Kneser graphs. Electron. J. Combin., 18(1):Paper 118, 17, 2011.
Benjamin Braun and Wesley K. Hough. Matching and independence complexes related to small grids. Electron. J. Combin., 24(4):Paper 4.18, 20, 2017.
Kenneth S. Brown. Euler characteristics of discrete groups and \(G\)-spaces. Invent. Math., 27:229–264, 1974.
Kenneth S. Brown. Euler characteristics of groups: the \(p\)-fractional part. Invent. Math., 29(1):1–5, 1975.
Boris Bukh. Topological methods in combinatorics: on wedges and joins. Lecture notes available at http://www.borisbukh.org/TopCombLent12/notes wedgejoin.pdf.
Alexander Engström. Independence complexes of claw-free graphs. European J. Combin., 29(1):234–241, 2008.
Alexander Engström. Complexes of directed trees and independence complexes. Discrete Math., 309(10):3299–3309, 2009.
Robin Forman. A user’s guide to discrete Morse theory. Sém. Lothar. Combin., 48:Art. B48c, 35, 2002.
Joel Friedman and Phil Hanlon. On the Betti numbers of chessboard complexes. Journal of Algebraic Combinatorics, 8(2):193–203, 1998.
Allen Hatcher. Algebraic topology. Cambridge University Press, Cambridge, 2002.
GE Hite, TP Živković, and DJ Klein. Conjugated circuit theory for graphite. Theoretica chimica acta, 74(5):349–361, 1988.
Marija Jelić Milutinović, Helen Jenne, Alex McDonough, and Julianne Vega. Matching complexes of trees and applications of the matching tree algorithm, 2019.
Jakob Jonsson. Matching complexes on grids. unpublished manuscript available at http://www.math.kth.se/~jakobj/doc/thesis/grid.pdf.
Jakob Jonsson. Simplicial complexes of graphs, volume 1928 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 2008.
DJ Klein, GE Hite, WA Seitz, and TG Schmalz. Dimer coverings and Kekulé structures on honeycomb lattice strips. Theoretica chimica acta, 69(5-6):409–423, 1986.
Dmitry Kozlov. Combinatorial algebraic topology, volume 21 of Algorithms and Computation in Mathematics. Springer, Berlin, 2008.
Dmitry N. Kozlov. Complexes of directed trees. J. Combin. Theory Ser. A, 88(1):112–122, 1999.
Greg Kuperberg. Symmetries of plane partitions and the permanent-determinant method. J. Combin. Theory Ser. A, 68(1):115–151, 1994.
Mario Marietti and Damiano Testa. Cores of simplicial complexes. Discrete Comput. Geom., 40(3):444–468, 2008.
Mario Marietti and Damiano Testa. A uniform approach to complexes arising from forests. Electron. J. Combin., 15(1):Research Paper 101, 18, 2008.
Takahiro Matsushita. Matching complexes of polygonal line tilings. 2019. arXiv:1910.00186 [math.CO].
Takahiro Matsushita. Matching complexes of small grids. Electron. J. Combin., 26(3):Paper 3.1, 8, 2019.
Daniel Quillen. Homotopy properties of the poset of nontrivial \(p\)-subgroups of a group. Adv. in Math., 28(2):101–128, 1978.
John Shareshian and Michelle L. Wachs. Torsion in the matching complex and chessboard complex. Adv. Math., 212(2):525–570, 2007.
Anurag Singh. Bounded degree complexes of forests. Discrete Math., 343(10):112009, 7, 2020.
Richard P. Stanley. Symmetries of plane partitions. J. Combin. Theory Ser. A, 43(1):103–113, 1986.
Rade T. Živaljević and Siniša T. Vrećica. The colored Tverberg’s problem and complexes of injective functions. J. Combin. Theory Ser. A, 61(2):309–318, 1992.
Michelle L. Wachs. Topology of matching, chessboard, and general bounded degree graph complexes. Algebra Universalis, 49(4):345–385, 2003. Dedicated to the memory of Gian-Carlo Rota.
George W. Whitehead. Homotopy groups of joins and unions. Trans. Amer. Math. Soc., 83:55–69, 1956.
Russ Woodroofe. Vertex decomposable graphs and obstructions to shellability. Proc. Amer. Math. Soc., 137(10):3235–3246, 2009.
Günter M. Ziegler. Shellability of chessboard complexes. Israel J. Math., 87(1-3):97–110, 1994.
Acknowledgements
This work was partially completed during the 2019 Graduate Research Workshop in Combinatorics. The workshop was partially funded by NSF grants 1603823, 1604773 and 1604458, “Collaborative Research: Rocky Mountain— Great Plains Graduate Research Workshops in Combinatorics,” NSA grant H98230-18-1-0017, “The 2018 and 2019 Rocky Mountain—Great Plains Graduate Research Workshops in Combinatorics,” Simons Foundation Collaboration Grants #316262 and #426971 and grants from the Combinatorics Foundation and the Institute for Mathematics and its Applications. Additional funding was provided by Grant #174034 of the Ministry of Education, Science and Technological Development of Serbia. We would like to thank Margaret Bayer and Bennet Goeckner for their insights and guidance on this project. Additionally, we would like to thank Benjamin Braun, Russ Woodroofe, Mario Marietti, and Damiano Testa for their helpful comments on this manuscript. Finally, we would like to thank the anonymous referee whose comments sketched a proof Theorem 5.19.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Bridget Tenner.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix A. Computations for the Homotopy Type of Trees
Appendix A. Computations for the Homotopy Type of Trees
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Jelić Milutinović, M., Jenne, H., McDonough, A. et al. Matching Complexes of Trees and Applications of the Matching Tree Algorithm. Ann. Comb. 26, 1041–1075 (2022). https://doi.org/10.1007/s00026-022-00605-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00026-022-00605-3