Abstract
A matching in a hypergraph H is a set of pairwise vertex disjoint edges in H and the matching number of H is the maximum cardinality of a matching in H. A hypergraph H is an intersecting hypergraph if every two distinct edges of H have a non-empty intersection. Equivalently, H is an intersecting hypergraph if and only if it has matching number one. In this paper, we study intersecting hypergraphs that are matching critical in the sense that the matching number increases under various definitions of criticality.
Sign-in/Register to access full text options 
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.
