Results 51 to 60 of about 1,556,418 (219)
Matching numbers and dimension of edge ideals [PDF]
arXiv, 2020 Let $G$ be a finite simple graph on the vertex set $V(G) = \{x_{1}, \ldots, x_{n}\}$ and match$(G)$, min-match$(G)$ and ind-match$(G)$ the matching number, minimum matching number and induced matching number of $G$, respectively. Let $K[V(G)] = K[x_{1}, \ldots, x_{n}]$ denote the polynomial ring over a field $K$ and $I(G) \subset K[V(G)]$ the edge ...
arxiv
Does Matching Overcome Lalonde's Critique of Nonexperimental Estimators?
, 2000 This paper applies cross-sectional and longitudinal propensity score matching estimators to data from the National Supported Work (NSW) Demonstration that have been previously analyzed by LaLonde (1986) and Dehejia and Wahba (1999, 2002).
Jeffrey A. Smith, Petra E. Todd
semanticscholar +1 more source
On Distance-3 Matchings and Induced Matchings
Discrete Applied Mathematics, 2009 AbstractFor a finite undirected graph G=(V,E) and positive integer k≥1, an edge set M⊆E is a distance-k matching if the pairwise distance of edges in M is at least k in G. For k=1, this gives the usual notion of matching in graphs, and for general k≥1, distance-k matchings were called k-separated matchings by Stockmeyer and Vazirani. The special case k=
A. Brandstadt, MOSCA, Raffaele
openaire +5 more sources
Optimal Matching with Matching Priority
AnalyticsMatching algorithms are commonly used to build comparable subsets (matchings) in observational studies. When a complete matching is not possible, some units must necessarily be excluded from the final matching. This may bias the final estimates comparing the two populations, and thus it is important to reduce the number of drops to avoid unsatisfactory
Massimo Cannas, Emiliano Sironi
openaire +2 more sources
On perfect matchings in matching covered graphs [PDF]
Journal of Graph Theory, 2018 AbstractA graph is matching‐covered if every edge of is contained in a perfect matching. A matching‐covered graph is strongly coverable if, for any edge of , the subgraph is still matching‐covered. An edge subset of a matching‐covered graph is feasible if there exist two perfect matchings and such that , and an edge subset with at least two ...
Jinghua He +3 more
openaire +3 more sources
A generalised matching distribution for the problem of coincidences [PDF]
arXiv, 2021 This paper examines the classical matching distribution arising in the "problem of coincidences". We generalise the classical matching distribution with a preliminary round of allocation where items are correctly matched with some fixed probability, and remaining non-matched items are allocated using simple random sampling without replacement.
arxiv
On some hard and some tractable cases of the maximum acyclic matching problem [PDF]
arXiv, 2017 Three well-studied types of subgraph-restricted matchings are induced matchings, uniquely restricted matchings, and acyclic matchings. While it is hard to determine the maximum size of a matching of each of these types, whether some given graph has a maximum matching that is induced or has a maximum matching that is uniquely restricted, can both be ...
arxiv
Matching structure and the matching lattice
Journal of Combinatorial Theory, Series B, 1987 AbstractThe matching polyhedron, i.e., the convex hull of (incidence vectors of) perfect matchings of a graph was characterized by Edmonds; this result is the key to a large part of polyhedral combinatorics and is used in many combinatorial algorithms.
openaire +2 more sources
Asymmetric colour matching: Memory matching versus simultaneous matching [PDF]
Color Research & Application, 2001 AbstractWe have compared corresponding pairs obtained by simultaneous matching (haploscopic matching) and by memory matching (after 10 min) using 34 reference tests selected from the Munsell Atlas (glossy), belonging to the four main hues 5Y, 5G, 5PB, and 5RP.
Fez Saiz, Dolores de +4 more
openaire +3 more sources
Matchings and matching extensions in graphs
Discrete Mathematics, 1998 AbstractLet G be a graph with a perfect matching and k be an integer such that 1 ⩽ k < vbV(G)vb/2. Then G is said to be k-extendable if every matching of size k in G extends to a perfect matching of G. Plummer (1994) proved that every (2k + 1)-connected K1,3-free graph of even order is k-extendable.
openaire +2 more sources