Results 21 to 30 of about 622 (259)
Planar cycle-extendable graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceFor most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs - that is, connected nontrivial graphs with the property that each edge belongs to some perfect matching.
Aditya Y Dalwadi +3 more
doaj +1 more source
Matchings of quadratic size extend to long cycles in hypercubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Ruskey and Savage in 1993 asked whether every matching in a hypercube can be extended to a Hamiltonian cycle. A positive answer is known for perfect matchings, but the general case has been resolved only for matchings of linear size.
Tomáš Dvořák
doaj +1 more source
Perfect Matchings and Perfect Powers [PDF]
Journal of Algebraic Combinatorics, 2003 In the last decade there have been many results about special families of graphs whose number of perfect matchings is given by perfect or near perfect powers. In this paper we present an approach that allows proving them in a unified way. We use this approach to prove a conjecture of James Propp stating that the number of tilings of the so-called Aztec
openaire +3 more sources
Near-Perfect Matchings on Cylinders Cm × Pn of Odd Order
EPJ Web of Conferences, 2018 A close relationship was established between the number of perfect and nearperfect matchings on cylinders Cm×Pn. Generating functions are obtained for the number of near-perfect matchings in these graphs for fixed odd m ≤ 13. A conjecture is put forth on
Perepechko Sergey N.
doaj +1 more source
Neuroplasticity and MRI: A perfect match [PDF]
NeuroImage, 2016 Numerous studies have illustrated the benefits of physical workout and cognitive exercise on brain function and structure and, more importantly, on decelerating cognitive decline in old age and promoting functional rehabilitation following injury. Despite these behavioral observations, the exact mechanisms underlying these neuroplastic phenomena remain
Julie Hamaide +2 more
openaire +3 more sources
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
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
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