Disjoint perfect matchings in 3‐uniform hypergraphs
type: Item
instance of: scholarly article
title: Disjoint perfect matchings in 3‐uniform hypergraphs
zbMATH Open document ID: 1404.05169
author: Hongliang Lu
author: Xingxing Yu
author: Li Zhang
published in: Journal of Graph Theory
publication date: 2018-07-13T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 6903737
zbMATH Keywords: disjoint perfect matching
zbMATH Keywords: 3-uniform hypergraph
MaRDI profile type: MaRDI publication profile
full work available at URL: jgt.22211
OpenAlex ID: W2768584795
DOI: 10.1002/JGT.22211
Recommended article: Matchings in 3-uniform hypergraphs of large minimum vertex degree
Recommended article: Improved bound on vertex degree version of Erdős matching conjecture
Recommended article: Matchings in 3-uniform hypergraphs
Recommended article: On the maximum number of edges in a hypergraph with given matching number
Recommended article: On perfect matchings in uniform hypergraphs with large minimum vertex degree
Recommended article: Perfect matchings in 3-uniform hypergraphs with large vertex degree
Recommended article: Matching of given sizes in hypergraphs
Recommended article: On matchings in hypergraphs
Recommended article: Nearly perfect matchings in uniform hypergraphs
Recommended article: Q3568712
description: scientific article; zbMATH DE number 6903737