A note on a conjecture of Ryser (Q1346392): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Maximum degree and fractional matchings in uniform hypergraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matchings and covers in hypergraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Upper bound for transversals of tripartite hypergraphs / rank | |||
Normal rank | |||
Latest revision as of 11:26, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on a conjecture of Ryser |
scientific article |
Statements
A note on a conjecture of Ryser (English)
0 references
2 July 1995
0 references
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.
0 references
matching
0 references
conjecture of Ryser
0 references
hypergraph
0 references
