License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2022.64
URN: urn:nbn:de:0030-drops-164057
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16405/
Go to the corresponding LIPIcs Volume Portal

Gan, Luyining ; Han, Jie

The Decision Problem for Perfect Matchings in Dense Hypergraphs

pdf-format:
LIPIcs-ICALP-2022-64.pdf (0.8 MB)

Abstract

Given 1 ≤ ? < k and δ ≥ 0, let PM(k,?,δ) be the decision problem for the existence of perfect matchings in n-vertex k-uniform hypergraphs with minimum ?-degree at least δ binom(n-?,k-?). For k ≥ 3, the decision problem in general k-uniform hypergraphs, equivalently PM(k,?,0), is one of Karp’s 21 NP-complete problems. Moreover, for k ≥ 3, a reduction of Szymańska showed that PM(k, ?, δ) is NP-complete for δ < 1-(1-1/k)^{k-?}. A breakthrough by Keevash, Knox and Mycroft [STOC '13] resolved this problem for ? = k-1 by showing that PM(k, k-1, δ) is in P for δ > 1/k. Based on their result for ? = k-1, Keevash, Knox and Mycroft conjectured that PM(k, ?, δ) is in P for every δ > 1-(1-1/k)^{k-?}.
In this paper it is shown that this decision problem for perfect matchings can be reduced to the study of the minimum ?-degree condition forcing the existence of fractional perfect matchings. That is, we hopefully solve the "computational complexity" aspect of the problem by reducing it to a well-known extremal problem in hypergraph theory. In particular, together with existing results on fractional perfect matchings, this solves the conjecture of Keevash, Knox and Mycroft for ? ≥ 0.4k.

BibTeX - Entry

@InProceedings{gan_et_al:LIPIcs.ICALP.2022.64,
  author =	{Gan, Luyining and Han, Jie},
  title =	{{The Decision Problem for Perfect Matchings in Dense Hypergraphs}},
  booktitle =	{49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)},
  pages =	{64:1--64:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-235-8},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{229},
  editor =	{Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/16405},
  URN =		{urn:nbn:de:0030-drops-164057},
  doi =		{10.4230/LIPIcs.ICALP.2022.64},
  annote =	{Keywords: Computational Complexity, Perfect Matching, Hypergraph}
}

Keywords: Computational Complexity, Perfect Matching, Hypergraph
Collection: 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Issue Date: 2022
Date of publication: 28.06.2022

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI