Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
From MaRDI portal
Publication:2975787
DOI10.1090/tran/6999zbMath1359.05100arXiv1409.5931OpenAlexW2962841333MaRDI QIDQ2975787
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
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (18)
Matching of Given Sizes in Hypergraphs ⋮ Near Perfect Matchings in ${k}$-Uniform Hypergraphs II ⋮ Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths ⋮ Graph Tilings in Incompatibility Systems ⋮ Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu ⋮ F$F$‐factors in Quasi‐random Hypergraphs ⋮ Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles ⋮ A Ramsey–Turán theory for tilings in graphs ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ The Complexity of Perfect Packings in Dense Graphs ⋮ Polynomial-time perfect matchings in dense hypergraphs ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs ⋮ The complexity of perfect matchings and packings in dense hypergraphs ⋮ Hamilton cycles in hypergraphs below the Dirac threshold ⋮ Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles ⋮ Cyclic triangle factors in regular tournaments
Cites Work
- Unnamed Item
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Tight co-degree condition for perfect matchings in 4-graphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- Polynomial-time perfect matchings in dense hypergraphs
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Perfect matchings in uniform hypergraphs with large minimum degree
- Perfect matchings in 4-uniform hypergraphs
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree
- Minimum codegree threshold for \((K^3_4-e)\)-factors
- Matchings in 3-uniform hypergraphs
- \(F\)-factors in hypergraphs via absorption
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Reducibility among Combinatorial Problems
- Paths, Trees, and Flowers
- Near Perfect Matchings ink-Uniform Hypergraphs
- Matchings in hypergraphs of large minimum degree
- Polynomial-time perfect matchings in dense hypergraphs
- A geometric theory for hypergraph matching
- The Factorization of Linear Graphs
This page was built for publication: Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
