The complexity of perfect matchings and packings in dense hypergraphs
From MaRDI portal
Publication:2284737
DOI10.1016/j.jctb.2019.06.004zbMath1430.05093arXiv1609.06147OpenAlexW2963408774WikidataQ127480333 ScholiaQ127480333MaRDI QIDQ2284737
Publication date: 15 January 2020
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.06147
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Density (toughness, etc.) (05C42)
Related Items (9)
Matching of Given Sizes in Hypergraphs ⋮ Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths ⋮ 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 ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Combinatorial and computational aspects of graph packing and graph decomposition
- Polynomial-time perfect matchings in dense hypergraphs
- A fast algorithm for equitable coloring
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Perfect matchings in uniform hypergraphs with large minimum degree
- Packing \(k\)-partite \(k\)-uniform hypergraphs
- Perfect matchings in 4-uniform hypergraphs
- A note on perfect matchings in 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
- Maximum bounded \(H\)-matching is Max SNP-complete
- Tiling Turán theorems
- \(H\)-factors in dense graphs
- The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree
- Matchings in 3-uniform hypergraphs
- The minimum degree threshold for perfect graph packings
- \(F\)-factors in hypergraphs via absorption
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- On extremal problems of graphs and generalized graphs
- Perfect packings with complete graphs minus an edge
- Fractional and integer matchings in uniform hypergraphs
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- Recent advances on Dirac-type problems for hypergraphs
- Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
- The Complexity of Perfect Packings in Dense Graphs
- On the Complexity of General Graph Factor Problems
- COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY
- Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture
- Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
- On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Powers of tensors and fast matrix multiplication
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Critical chromatic number and the complexity of perfect packings in graphs
- Embedding large subgraphs into dense graphs
- Proof of a tiling conjecture of Komlós
- K4−‐factor in a graph
- Reducibility among Combinatorial Problems
- Paths, Trees, and Flowers
- Matchings in hypergraphs of large minimum degree
- The Factorization of Linear Graphs
- Proof of the Alon-Yuster conjecture
This page was built for publication: The complexity of perfect matchings and packings in dense hypergraphs
