d-matching in k-uniform hypergraphs

DOI10.1142/S1793830917500720zbMath1386.05128OpenAlexW2766492472MaRDI QIDQ4597954

No author found.

Publication date: 14 December 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830917500720

zbMATH Keywords

matchingperfect matching\(k\)-uniform hypergraphore-type

Mathematics Subject Classification ID

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

Related Items (2)

Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs ⋮ Matching in 3-uniform hypergraphs

Cites Work

• Unnamed Item
• 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
• An approximate Dirac-type theorem for \(k\)-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
• Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• Degrees giving independent edges in a hypergraph
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Paths, Trees, and Flowers
• Matchings in hypergraphs of large minimum degree
• The Factorization of Linear Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: d-matching in k-uniform hypergraphs