General polygonal line tilings and their matching complexes

DOI10.1016/J.DISC.2023.113428MaRDI QIDQ6041860zbMATH OpenFDO

Authors Margaret M. Bayer, Marija Jelić Milutinović, Julianne Vega

Publication date 15 May 2023

Published in Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/2211.12559

zbMATH Keywords

homotopy typeindependence complexmatching complexpolygonal tiling

Mathematics Subject Classification ID

Combinatorial aspects of simplicial complexes (05E45) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Homotopy equivalences in algebraic topology (55P10)

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.

Recommendations

• Matching complexes of polygonal line tilings
• The cubical matching complex
• The cubical matching complex revisited
• Paarweise kantendisjunkte maximale matchings in normalen periodischen Pflasterungen. (On pairwise edge-disjoint maximal matchings in normal periodic tilings)
• Perfect matching complexes of honeycomb graphs

Cites work

• A uniform approach to complexes arising from forests
• Chessboard Complexes and Matching Complexes
• Complexes of directed trees
• Complexes of directed trees and independence complexes
• Decompositions and connectivity of matching and chessboard complexes
• Independence complexes of claw-free graphs
• MANIFOLD MATCHING COMPLEXES
• Matching and independence complexes related to small grids
• Matching complexes of polygonal line tilings
• Matching complexes of small grids
• Matching complexes of trees and applications of the matching tree algorithm
• On the h-vectors of chessboard complexes
• Shellability of chessboard complexes
• Simplicial complexes of graphs
• Splittings of independence complexes and the powers of cycles
• Topology of matching, chessboard, and general bounded degree graph complexes
• Torsion in the matching complex and chessboard complex

Cited in

(8)

• Equivalence between Clar covering polynomials of single zigzag chains and tiling polynomials of 2 n rectangles
• Matching complexes of polygonal line tilings
• The cubical matching complex revisited
• scientific article; zbMATH DE number 7407644 (Why is no real title available?)
• Signed polyomino tilings by n-in-line polyominoes and Gröbner bases
• Perfect matching complexes of honeycomb graphs
• Dominance complexes, neighborhood complexes and combinatorial Alexander duals
• Perfect matching complexes of polygonal line tilings

This page was built for publication: General polygonal line tilings and their matching complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041860)