Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs

DOI10.1090/tran/6999zbMath1359.05100arXiv1409.5931MaRDI QIDQ2975787

Jie Han

Publication date: 12 April 2017

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.5931

zbMATH Keywords

hypergraph; perfect matching; absorbing method

Mathematics Subject Classification ID

05C65: Hypergraphs

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)