Matchings in hypergraphs of large minimum degree
From MaRDI portal
Publication:5469026
DOI10.1002/jgt.20139zbMath1087.05041OpenAlexW4232826661MaRDI QIDQ5469026
Publication date: 16 May 2006
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20139
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Counting Hamilton cycles in Dirac hypergraphs ⋮ Matching of Given Sizes in Hypergraphs ⋮ Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs ⋮ Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture ⋮ Fractional and integer matchings in uniform hypergraphs ⋮ Perfect matchings in uniform hypergraphs with large minimum degree ⋮ Near Perfect Matchings in ${k}$-Uniform Hypergraphs II ⋮ Co-degree density of hypergraphs ⋮ Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree ⋮ Vertex degree sums for perfect matchings in 3-uniform hypergraphs ⋮ Co-degree threshold for rainbow perfect matchings in uniform hypergraphs ⋮ Perfect matchings in 3-partite 3-uniform hypergraphs ⋮ Covering and tiling hypergraphs with tight cycles ⋮ \(d\)-matching in 3-uniform hypergraphs ⋮ Perfect matchings in 4-uniform hypergraphs ⋮ d-matching in k-uniform hypergraphs ⋮ Near Perfect Matchings ink-Uniform Hypergraphs ⋮ A note on perfect matchings in uniform hypergraphs ⋮ Almost Perfect Matchings in $k$-Partite $k$-Graphs ⋮ Exact minimum degree thresholds for perfect matchings in uniform hypergraphs ⋮ Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees ⋮ Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs ⋮ Families of triples with high minimum degree are Hamiltonian ⋮ Polynomial-time perfect matchings in dense hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Covering and tiling hypergraphs with tight cycles ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Note on matchings in 3-partite 3-uniform hypergraphs ⋮ Matching in 3-uniform hypergraphs ⋮ Dirac-type results for loose Hamilton cycles in uniform hypergraphs ⋮ Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs ⋮ Unnamed Item ⋮ Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs ⋮ The complexity of perfect matchings and packings in dense hypergraphs ⋮ Hamilton cycles in hypergraphs below the Dirac threshold ⋮ A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs ⋮ Co-degrees resilience for perfect matchings in random hypergraphs ⋮ Perfect matchings in \(r\)-partite \(r\)-graphs ⋮ Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree ⋮ Perfect matchings in large uniform hypergraphs with large minimum collective degree ⋮ Matching criticality in intersecting hypergraphs ⋮ Nearly Perfect Matchings in Uniform Hypergraphs ⋮ A geometric theory for hypergraph matching ⋮ Vertex degree sums for matchings in 3-uniform hypergraphs ⋮ Tight bounds for powers of Hamilton cycles in tournaments ⋮ \(F\)-factors in hypergraphs via absorption
Cites Work
