Tight co-degree condition for perfect matchings in 4-graphs
From MaRDI portal
Publication:426891
zbMath1244.05176MaRDI QIDQ426891
Andrzej Czygrinow, Vikram Kamat
Publication date: 12 June 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i2p20
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Matching of Given Sizes in Hypergraphs ⋮ Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture ⋮ Near Perfect Matchings in ${k}$-Uniform Hypergraphs II ⋮ Packing \(k\)-partite \(k\)-uniform hypergraphs ⋮ Perfect matchings in 3-partite 3-uniform hypergraphs ⋮ Near Perfect Matchings ink-Uniform Hypergraphs ⋮ A note on perfect matchings in uniform hypergraphs ⋮ Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs ⋮ Exact minimum degree thresholds for perfect matchings in uniform hypergraphs ⋮ Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs ⋮ Polynomial-time perfect matchings in dense hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs ⋮ Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs ⋮ The complexity of perfect matchings and packings in dense hypergraphs ⋮ A geometric theory for hypergraph matching ⋮ Minimum Vertex Degree Threshold for ‐tiling* ⋮ Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
