d-matching in k-uniform hypergraphs

DOI10.1142/S1793830917500720MaRDI QIDQ4597954zbMATH OpenOpenAlexFDO

Authors

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

\(k\)-uniform hypergraphmatchingore-typeperfect matching

Mathematics Subject Classification ID

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

Recommendations

• \(d\)-matching in 3-uniform hypergraphs
• Matching in 3-uniform hypergraphs
• Matching of given sizes in hypergraphs
• Near perfect matchings in \(k\)-uniform hypergraphs
• Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs

Cites work

• An approximate Dirac-type theorem for k-uniform hypergraphs
• Degrees giving independent edges in a hypergraph
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Matchings in 3-uniform hypergraphs
• Matchings in hypergraphs of large minimum degree
• On perfect matchings in uniform hypergraphs with large minimum vertex degree
• Paths, Trees, and Flowers
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
• Perfect matchings and K₄^3-tilings in hypergraphs of large codegree
• Perfect matchings in 3-uniform hypergraphs with large vertex degree
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Perfect matchings in uniform hypergraphs with large minimum degree
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Some Theorems on Abstract Graphs
• The Factorization of Linear Graphs

Cited in

(6)

• Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs
• \(d\)-matching in 3-uniform hypergraphs
• Matching in 3-uniform hypergraphs
• Matching and domination numbers in \(r\)-uniform hypergraphs
• Matching of given sizes in hypergraphs
• On the matching number of \(k\)-uniform connected hypergraphs with maximum degree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4597954)