Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees

DOI10.1016/j.ejc.2011.02.001zbMath1229.05231OpenAlexW2074971154MaRDI QIDQ641543

Andrzej Ruciński, Klas Markström

Publication date: 24 October 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.02.001

zbMATH Keywords

Hamilton cycles\(k\)-uniform hypergraph

Mathematics Subject Classification ID

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

Related Items (37)

On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size ⋮ Perfect packings in quasirandom hypergraphs. I. ⋮ 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 ⋮ Near Perfect Matchings in ${k}$-Uniform Hypergraphs II ⋮ Vertex degree sums for perfect matchings in 3-uniform hypergraphs ⋮ On vertex independence number of uniform hypergraphs ⋮ Packing \(k\)-partite \(k\)-uniform hypergraphs ⋮ Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs ⋮ Perfect matchings in 3-partite 3-uniform hypergraphs ⋮ \(d\)-matching in 3-uniform hypergraphs ⋮ Perfect matchings in 4-uniform hypergraphs ⋮ On extremal hypergraphs for Hamiltonian cycles ⋮ d-matching in k-uniform hypergraphs ⋮ Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels ⋮ Near Perfect Matchings ink-Uniform Hypergraphs ⋮ A note on perfect matchings in uniform hypergraphs ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ 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 ⋮ Note on matchings in 3-partite 3-uniform hypergraphs ⋮ On the Hamiltonicity of triple systems with high minimum degree ⋮ Matching in 3-uniform hypergraphs ⋮ Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs ⋮ Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs ⋮ Unnamed Item ⋮ Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ The complexity of perfect matchings and packings in dense hypergraphs ⋮ Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs ⋮ A geometric theory for hypergraph matching ⋮ Vertex degree sums for matchings in 3-uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect matchings in uniform hypergraphs with large minimum degree
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• Ryser's conjecture for tripartite 3-graphs
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Dirac-type results for loose Hamilton cycles in uniform hypergraphs
• Hamilton \(\ell \)-cycles in 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
• A comment on Ryser's conjecture for intersecting hypergraphs
• Matchings in 3-uniform hypergraphs
• On extremal problems of graphs and generalized graphs
• Perfect matchings in \(r\)-partite \(r\)-graphs
• An Erdös-Ko-Rado theorem for direct products
• Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
• COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY
• On maximal paths and circuits of graphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree
• Embedding large subgraphs into dense graphs
• Degrees giving independent edges in a hypergraph
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Hamiltonian chains in hypergraphs
• Matchings in hypergraphs of large minimum degree
• Some Theorems on Abstract Graphs

This page was built for publication: Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees