\(d\)-matching in 3-uniform hypergraphs
From MaRDI portal
Publication:1690241
DOI10.1016/j.disc.2017.11.014zbMath1378.05175OpenAlexW2780151222MaRDI QIDQ1690241
Publication date: 19 January 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.11.014
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (5)
Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs ⋮ Vertex degree sums for perfect matchings in 3-uniform hypergraphs ⋮ The research and progress of the enumeration of lattice paths ⋮ Matching in 3-uniform hypergraphs ⋮ Vertex degree sums for matchings in 3-uniform hypergraphs
Cites Work
- Unnamed Item
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Perfect matchings in uniform hypergraphs with large minimum degree
- Perfect matchings in 4-uniform hypergraphs
- A note on perfect matchings in uniform hypergraphs
- An approximate Dirac-type theorem for \(k\)-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 condition for matchability in hypergraphs
- Matchings in 3-uniform hypergraphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- Perfect matchings in balanced hypergraphs
- Fractional and integer matchings in uniform hypergraphs
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- Recent advances on Dirac-type problems for hypergraphs
- Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Embedding large subgraphs into dense graphs
- Degrees giving independent edges in a hypergraph
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Reducibility among Combinatorial Problems
- Paths, Trees, and Flowers
- Near Perfect Matchings ink-Uniform Hypergraphs
- Matchings in hypergraphs of large minimum degree
- The Factorization of Linear Graphs
- Some Theorems on Abstract Graphs
This page was built for publication: \(d\)-matching in 3-uniform hypergraphs
