Results 31 to 40 of about 2,022 (201)
Perfect Matchings and Cluster Algebras of Classical Type [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 In this paper we give a graph theoretic combinatorial interpretation for the cluster variables that arise in most cluster algebras of finite type. In particular, we provide a family of graphs such that a weighted enumeration of their perfect matchings ...
Gregg Musiker
doaj +1 more source
Even cycles and perfect matchings in claw-free plane graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Lov{\'a}sz showed that a matching covered graph $G$ has an ear decomposition starting with an arbitrary edge of $G$. Let $G$ be a graph which has a perfect matching.
Shanshan Zhang +2 more
doaj +1 more source
Fractional matching preclusion for butterfly derived networks
Theory and Applications of Graphs, 2019 The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings.
Xia Wang +4 more
doaj +1 more source
Revisiting a Cutting-Plane Method for Perfect Matchings
Open Journal of Mathematical Optimization, 2020 In 2016, Chandrasekaran, Végh, and Vempala (Mathematics of Operations Research, 41(1):23–48) published a method to solve the minimum-cost perfect matching problem on an arbitrary graph by solving a strictly polynomial number of linear programs.
Chen, Amber Q. +3 more
doaj +1 more source
Packing Plane Perfect Matchings into a Point Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Given a set $P$ of $n$ points in the plane, where $n$ is even, we consider the following question: How many plane perfect matchings can be packed into $P$? For points in general position we prove the lower bound of ⌊log2$n$⌋$-1$.
Ahmad Biniaz +3 more
doaj +1 more source
Annihilating random walks and perfect matchings of planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 We study annihilating random walks on $\mathbb{Z}$ using techniques of P.W. Kasteleyn and $R$. Kenyonon perfect matchings of planar graphs. We obtain the asymptotic of the density of remaining particles and the partition function of the underlying ...
Massimiliano Mattera
doaj +1 more source
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles [PDF]
, 2019 Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings via alternating cycles. Namely, we want to find a shortest sequence of perfect matchings which transforms one given perfect matching ...
Ito, Takehiro +4 more
core +1 more source
Electronic Journal of Graph Theory and Applications, 2017 In decomposition theory, extreme sets have been studied extensively due to its connection to perfect matchings in a graph. In this paper, we first define extreme sets with respect to degree-matchings and next investigate some of their properties.
Radosław Cymer
doaj +1 more source
Near―perfect non-crossing harmonic matchings in randomly labeled points on a circle [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Consider a set $S$ of points in the plane in convex position, where each point has an integer label from $\{0,1,\ldots,n-1\}$. This naturally induces a labeling of the edges: each edge $(i,j)$ is assigned label $i+j$, modulo $n$.
József Balogh +2 more
doaj +1 more source
Generalized Matching Preclusion in Bipartite Graphs
Theory and Applications of Graphs, 2018 The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal such sets are precisely sets of edges
Zachary Wheeler +4 more
doaj +1 more source