Matching of Given Sizes in Hypergraphs
From MaRDI portal
Publication:5043636
DOI10.1137/21M1430327zbMath1498.05217arXiv2106.16068MaRDI QIDQ5043636
Yu-Lin Chang, Jie Han, Guang-Hui Wang, Huifen Ge
Publication date: 6 October 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.16068
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
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
- 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
- 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
- Matchings in 3-uniform hypergraphs
- The Erdős matching conjecture and concentration inequalities
- The complexity of perfect matchings and packings in dense hypergraphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- 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
- 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
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Embedding large subgraphs into dense graphs
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Nearly Perfect Matchings in Uniform Hypergraphs
- Reducibility among Combinatorial Problems
- Paths, Trees, and Flowers
- Near Perfect Matchings ink-Uniform Hypergraphs
- Matchings in hypergraphs of large minimum degree
- A geometric theory for hypergraph matching
- The Factorization of Linear Graphs
This page was built for publication: Matching of Given Sizes in Hypergraphs
