Abstract:Ryser's conjecture says that for an r-partite hypergraph H with matching number ν(H), the vertex cover number is at most (r − 1)ν(H). This far reaching generalization of König's theorem is only known to be true for r ≤ 3, or α(G) = 1 and r ≤ 5. An equivalent formulation of Ryser's conjecture is that in every r-edge coloring of a graph G with independence number α(G), there exists at most (r − 1)α(G) monochromatic connected subgraphs which cover the vertex set of G.We make the case that this latter formulation … Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.