A note on a conjecture of Ryser

DOI10.1007/BF01876928zbMath0816.05045WikidataQ123226184 ScholiaQ123226184MaRDI QIDQ1346392

Penny E. Haxell

Publication date: 2 July 1995

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

zbMATH Keywords

hypergraphmatchingconjecture of Ryser

Mathematics Subject Classification ID

Hypergraphs (05C65) Transversal (matching) theory (05D15) Combinatorial aspects of packing and covering (05B40)

Related Items (5)

Matching and domination numbers in \(r\)-uniform hypergraphs ⋮ The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four ⋮ Domination and matching in power and generalized power hypergraphs ⋮ Estimates of the independence number of a hypergraph and the Ryser conjecture ⋮ Finding independent transversals efficiently

Cites Work

• Upper bound for transversals of tripartite hypergraphs
• Maximum degree and fractional matchings in uniform hypergraphs
• Matchings and covers in hypergraphs

This page was built for publication: A note on a conjecture of Ryser