Results 1 to 10 of about 4,122,423 (255)
On the approximability of the maximum induced matching problem [PDF]
Journal of Discrete Algorithms, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Manlove, Michele Zito
exaly +6 more sources
On the induced matching problem [PDF]
Journal of Computer and System Sciences, 2011 We study extremal questions on induced matchings in several natural graph classes. We argue that these questions should be asked for twinless graphs, that is graphs not containing two vertices with the same neighborhood. We show that planar twinless graphs always contain an induced matching of size at least $n/40$ while there are planar twinless graphs
Marcus Schaefer, Iyad Kanj, Ge Xia
exaly +11 more sources
The graphs with maximum induced matching and maximum matching the same size
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kathie Cameron
exaly +3 more sources
On Graphs with Induced Matching Number Almost Equal to Matching Number
Electronic Notes in Discrete Mathematics, 2015 Abstract Kobler and Rotics in 2003, and Cameron and Walker in 2005, gave a complete structural description of the graphs G where the matching number ν ( G ) equals the induced matching number ν 2 ( G ) . We study their result and use it to analyse graphs G with ν ( G ) − ν 2 ( G ) ≤ k .
Dieter Rautenbach +2 more
exaly +3 more sources
Antimatroids induced by matchings [PDF]
Discrete Applied Mathematics, 2019 We explore novel connections between antimatroids and matchings in bipartite graphs. In particular, we prove that a combinatorial structure induced by stable matchings or maximum-weight matchings is an antimatroid. Moreover, we demonstrate that every antimatroid admits such a representation by stable matchings and maximum-weight matchings.
Yasushi Kawase, Yutaro Yamaguchi 0001
openaire +4 more sources
Large Induced Matchings in Random Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2021 Given a large graph $H$, does the binomial random graph $G(n,p)$ contain a copy of $H$ as an induced subgraph with high probability? This classical question has been studied extensively for various graphs $H$, going back to the study of the independence number of $G(n,p)$ by Erdős and Bollobás, and Matula in 1976.
Oliver Cooley +3 more
openaire +4 more sources
On price-induced minmax matchings
CoRR, 2023 We study a natural combinatorial pricing problem for sequentially arriving buyers with equal budgets. Each buyer is interested in exactly one pair of items and purchases this pair if and only if, upon arrival, both items are still available and the sum of the item prices does not exceed the budget.
Christoph Dürr +2 more
openaire +2 more sources
Discrete Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angelika Steger, Min-Li Yu
openaire +3 more sources
Induced Matchings in Subcubic Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2014 We prove that a cubic graph with $m$ edges has an induced matching with at least $m/9$ edges. Our result generalizes a result for planar graphs due to Kang, Mnich, and Müller (Induced matchings in subcubic planar graphs, SIAM J. Discrete Math. 26 (2012) 1383-1411) and solves a conjecture of Henning and Rautenbach (Induced matchings in subcubic graphs ...
Felix Joos +2 more
openaire +2 more sources