A Characterization of Two-Dimensional Buchsbaum Matching Complexes
نویسندگان
چکیده
The matching complex $M(G)$ of a graph G is the set all matchings in G. A Buchsbaum simplicial generalization both homology manifold and Cohen–Macaulay complex. We give complete characterization graphs for which two-dimensional As an intermediate step, we determine have complexes that are themselves connected graphs.
منابع مشابه
Face Vectors of Two-Dimensional Buchsbaum Complexes
In this paper, we characterize all possible h-vectors of 2-dimensional Buchsbaum simplicial complexes.
متن کاملBuchsbaum* Complexes
A class of finite simplicial complexes, which we call Buchsbaum* over a field, is introduced. Buchsbaum* complexes generalize triangulations of orientable homology manifolds as well as doubly Cohen-Macaulay complexes. By definition, the Buchsbaum* property depends only on the geometric realization and the field. Characterizations in terms of simplicial homology are given. It is proved that Buch...
متن کاملSocles of Buchsbaum modules, complexes and posets
The socle of a graded Buchsbaum module is studied and is related to its local cohomology modules. This algebraic result is then applied to face enumeration of Buchsbaum simplicial complexes and posets. In particular, new necessary conditions on face numbers and Betti numbers of such complexes and posets are established. These conditions are used to settle in the affirmative Kühnel’s conjecture ...
متن کاملNeighborhood matrix: A new idea in matching of two dimensional gel images
Automated data analysis and pattern recognition techniques are the requirements of biological and proteomicsresearch studies. The analysis of proteins consists of some stages among which the analysis of two dimensionalelectrophoresis (2-DE) images is crucial. The aim of image capturing is to generate a Photostat that can be used infuture works such as image comparison. The researchers introduce...
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2023
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/11196