Perfect matching complexes of honeycomb graphs
From MaRDI portal
Publication:6106302
DOI10.37236/11525zbMath1517.05138arXiv2209.02803OpenAlexW4380987218MaRDI QIDQ6106302
Margaret M. Bayer, Marija Jelić Milutinović, Julianne Vega
Publication date: 27 June 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.02803
Classification of homotopy type (55P15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Relations of low-dimensional topology with graph theory (57M15) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- Unnamed Item
- Splittings of independence complexes and the powers of cycles
- The complexity of computing the permanent
- Complexity of simplicial homology and independence complexes of chordal graphs
- The clique operator on matching and chessboard graphs
- Complexes of directed trees and independence complexes
- The colored Tverberg's problem and complexes of injective functions
- Homotopy properties of the poset of nontrivial p-subgroups of a group
- Symmetries of plane partitions and the permanent-determinant method
- A user's guide to discrete Morse theory
- Complexes of directed trees
- On the topology of two partition posets with forbidden block sizes
- Matching complexes of small grids
- On the matching and permanental polynomials of graphs
- Matching complexes of trees and applications of the matching tree algorithm
- Matching complexes of polygonal line tilings
- Matching and independence complexes related to small grids
- Simplicial complexes of graphs
- The topology of the independence complex
- Topology of matching, chessboard, and general bounded degree graph complexes
- Matching complexes of \(3 \times n\) grid graphs
- Higher Independence Complexes of graphs and their homotopy types
- Hajós-Type Constructions and Neighborhood Complexes
- General polygonal line tilings and their matching complexes
- Independence complexes of \((n \times 4)\) and \((n \times 5)\)-grid graphs
- Line graphs with a Cohen-Macaulay or Gorenstein clique complex
- MANIFOLD MATCHING COMPLEXES
