A condition for matchability in hypergraphs
type: Item
instance of: scholarly article
title: A condition for matchability in hypergraphs
zbMATH Open document ID: 0837.05082
DOI: 10.1007/BF01793010
published in: Graphs and Combinatorics
publication date: 1995-10-31T00:00:00Z
review text: A complete matching in a hypergraph is a partition of the vertex set into pairwise disjoint edges. An analog of Hall's theorem about complete matchings in certain hypergraphs is proved.
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 811344
zbMATH Keywords: matching
zbMATH Keywords: hypergraph
zbMATH Keywords: Hall's theorem
author: Penny Haxell
reviewed by: Vladimir D. Tonchev
MaRDI profile type: Publication
cites work: Matchings in n-partite n-graphs
cites work: On a criterion for matchability in hypergraphs
cites work: On a possible extension of Hall's theorem to bipartite hypergraphs
description: scientific article; zbMATH DE number 811344