Parameterized Results on Acyclic Matchings with Implications for Related Problems

Juhi Chaudhary, Meirav Zehavi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


A matching M in a graph G is an acyclic matching if the subgraph of G induced by the endpoints of the edges of M is a forest. Given a graph G and a positive integer l, Acyclic Matching asks whether G has an acyclic matching of size (i.e., the number of edges) at least l. In this paper, we first prove that assuming (Formula presented), there does not exist any FPT-approximation algorithm for Acyclic Matching that approximates it within a constant factor when parameterized by l. Our reduction is general in the sense that it also asserts FPT-inapproximability for Induced Matching and Uniquely Restricted Matching. We also consider three below-guarantee parameters for Acyclic Matching, viz. (Formula presented), where n is the number of vertices in G, MM(G) is the matching number of G, and IS(G) is the independence number of G. We note that the result concerning the below-guarantee parameter n/2-l is the most technical part of our paper. Also, we show that Acyclic Matching does not exhibit a polynomial kernel with respect to vertex cover number (or vertex deletion distance to clique) plus the size of the matching unless (Formula presented).

Original languageAmerican English
Title of host publicationGraph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Revised Selected Papers
EditorsDaniël Paulusma, Bernard Ries
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages16
ISBN (Print)9783031433795
StatePublished - 1 Jan 2023
Event49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023 - Fribourg, Switzerland
Duration: 28 Jun 202330 Jun 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume14093 LNCS


Conference49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023


  • Acyclic Matching
  • Induced Matching
  • Kernelization Lower Bounds
  • Parameterized Algorithms
  • Uniquely Restricted Matching

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Parameterized Results on Acyclic Matchings with Implications for Related Problems'. Together they form a unique fingerprint.

Cite this