Year-end Sale % OFF 
Abstract
Consider a hypergraph of rank r > 2 with m edges, independence number α and edge cover number ρ . We prove the inequality ρ ⩽ ( r - 2 ) m + α r - 1 . One application of this inequality is a special case of a conjecture of Aharoni and the first author extending Ryser's Conjecture to matroids.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
