A note on a conjecture of Ryser
type: Item
instance of: scholarly article
title: A note on a conjecture of Ryser
zbMATH Open document ID: 0816.05045
DOI: 10.1007/BF01876928
published in: Periodica Mathematica Hungarica
publication date: 1995-07-02T00:00:00Z
review text: A special case of a conjecture of Ryser states that if a 3-partite 3- uniform hypergraph has at most \(n\) pairwise disjoint edges then there is a set of vertices of cardinality at most \(2n\) meeting all edges of the hypergraph. In this paper an upper bound equal to \((5/2)n\) is proved.
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 05D15
zbMATH DE Number: 737242
zbMATH Keywords: matching
zbMATH Keywords: conjecture of Ryser
zbMATH Keywords: hypergraph
Wikidata QID: Q123226184
author: Penny Haxell
reviewed by: Martin Loebl
MaRDI profile type: Publication
cites work: Maximum degree and fractional matchings in uniform hypergraphs
cites work: Matchings and covers in hypergraphs
cites work: Upper bound for transversals of tripartite hypergraphs
description: scientific article; zbMATH DE number 737242