General polygonal line tilings and their matching complexes
classification
🧮 math.CO
keywords
linepolygonalcyclesgeneralintersectingmatchingmatsushitatiling
read the original abstract
A (general) polygonal line tiling is a graph formed by a string of cycles, each intersecting the previous at an edge, no three intersecting. In 2022, Matsushita proved the matching complex of a certain type of polygonal line tiling with even cycles is homotopy equivalent to a wedge of spheres. In this paper, we extend Matsushita's work to include a larger family of graphs and carry out a closer analysis of lines of triangle and pentagons, where the Fibonacci numbers arise.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.