On Ryser's conjecture
From MaRDI portal
Publication:426782
zbMath1243.05198MaRDI QIDQ426782
Alexander D. Scott, Penny E. Haxell
Publication date: 12 June 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p23
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (13)
A note on intersecting hypergraphs with large cover number ⋮ Matching and domination numbers in \(r\)-uniform hypergraphs ⋮ On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs ⋮ Extremal hypergraphs for matching number and domination number ⋮ The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four ⋮ Extremal hypergraphs for Ryser's conjecture ⋮ On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs ⋮ On Ryser's conjecture for linear intersecting multipartite hypergraphs ⋮ Multipartite hypergraphs achieving equality in Ryser's conjecture ⋮ A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs ⋮ Domination and matching in power and generalized power hypergraphs ⋮ Covering graphs by monochromatic trees and Helly-type results for hypergraphs ⋮ Covering 3-Edge-Colored Random Graphs with Monochromatic Trees
This page was built for publication: On Ryser's conjecture
