Matchings in multipartite hypergraphs

DOI10.5070/C65165019MaRDI QIDQ7006794zbMATH OpenFDO

Authors Candida Bowtell, Richard Mycroft

Publication date 27 March 2025

Published in Combinatorial Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.5070/C65165019

zbMATH Keywords

hypergraphsmatchings

Mathematics Subject Classification ID

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

Cites work

• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• A geometric theory for hypergraph matching
• Almost perfect matchings in \(k\)-partite \(k\)-graphs
• Decision problem for perfect matchings in dense k-uniform hypergraphs
• Degrees giving independent edges in a hypergraph
• Dirac-type questions for hypergraphs -- a survey (or more problems for Endre to solve)
• Embedding large subgraphs into dense graphs
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• Fractional and integer matchings in uniform hypergraphs
• Hall's theorem for hypergraphs
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• Matching of given sizes in hypergraphs
• Matchings in 3-uniform hypergraphs
• Matchings in \(k\)-partite \(k\)-uniform hypergraphs
• Matchings in hypergraphs of large minimum degree
• Near perfect matchings in \(k\)-uniform hypergraphs
• Nearly perfect matchings in uniform hypergraphs
• On perfect matchings in \(k\)-complexes
• On perfect matchings in uniform hypergraphs with large minimum vertex degree
• On representatives of subsets.
• 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-partite 3-uniform hypergraphs
• Perfect matchings in 3-uniform hypergraphs with large vertex degree
• Perfect matchings in 4-uniform hypergraphs
• Perfect matchings in \(r\)-partite \(r\)-graphs
• Perfect matchings in hypergraphs and the Erdős matching conjecture
• Perfect matchings in uniform hypergraphs with large minimum degree
• Polynomial-time perfect matchings in dense hypergraphs
• Recent advances on Dirac-type problems for hypergraphs
• Reducibility among combinatorial problems
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Santa Claus Meets Hypergraph Matchings
• Some Theorems on Abstract Graphs
• The Complexity of Perfect Matching Problems on Dense Hypergraphs
• The Factorization of Linear Graphs
• The complexity of almost perfect matchings in uniform hypergraphs with high codegree
• The complexity of perfect matchings and packings in dense hypergraphs
• Tight co-degree condition for perfect matchings in 4-graphs

This page was built for publication: Matchings in multipartite hypergraphs

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