A note on a conjecture of Ryser
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.
scientific article; zbMATH DE number 737242