Some Ore-type results for matching and perfect matching in k-uniform hypergraphs
DOI10.1007/S10114-018-7260-1zbMATH Open1404.05145OpenAlexW2884634494WikidataQ129465866 ScholiaQ129465866MaRDI QIDQ1633862FDOQ1633862
Authors: Y. Aharonov 
Publication date: 21 December 2018
Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-018-7260-1
Recommendations
- Perfect matchings in uniform hypergraphs with large minimum degree
- Vertex degree sums for perfect matchings in 3-uniform hypergraphs
- \(d\)-matching in \(k\)-uniform hypergraphs
- Perfect matchings in 3-uniform hypergraphs with large vertex degree
- Vertex degree sums for matchings in 3-uniform hypergraphs
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Reducibility among combinatorial problems
- Embedding large subgraphs into dense graphs
- Paths, Trees, and Flowers
- The Factorization of Linear Graphs
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Matchings in 3-uniform hypergraphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- Fractional and integer matchings in uniform hypergraphs
- Perfect matchings in 3-uniform hypergraphs with large vertex degree
- On perfect matchings in uniform hypergraphs with large minimum vertex degree
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Perfect matchings in 4-uniform hypergraphs
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Perfect matchings in uniform hypergraphs with large minimum degree
- Matchings in hypergraphs of large minimum degree
- Recent advances on Dirac-type problems for hypergraphs
- Perfect matchings in hypergraphs and the Erdős matching conjecture
- A note on perfect matchings in uniform hypergraphs
- An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs
- Vertex degree sums for perfect matchings in 3-uniform hypergraphs
- \(d\)-matching in 3-uniform hypergraphs
- \(d\)-matching in \(k\)-uniform hypergraphs
Cited In (6)
- Vertex degree sums for matchings in 3-uniform hypergraphs
- Vertex degree sums for matchings in 3-uniform hypergraphs
- Vertex degree sums for perfect matchings in 3-uniform hypergraphs
- \(d\)-matching in \(k\)-uniform hypergraphs
- Matching in 3-uniform hypergraphs
- Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
This page was built for publication: Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633862)
