Note on matchings in 3-partite 3-uniform hypergraphs
From MaRDI portal
Publication:512618
DOI10.1016/J.DISC.2016.10.017zbMath1357.05109OpenAlexW2551784484MaRDI QIDQ512618
Publication date: 27 February 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.10.017
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Cites Work
- Perfect matchings in 3-partite 3-uniform hypergraphs
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Perfect matchings in 4-uniform hypergraphs
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- Matchings in 3-uniform hypergraphs
- Perfect matchings in \(r\)-partite \(r\)-graphs
- 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
- Degrees giving independent edges in a hypergraph
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Matchings in hypergraphs of large minimum degree
This page was built for publication: Note on matchings in 3-partite 3-uniform hypergraphs
