Matching critical intersection hypergraphs

Michael A. Henning, Anders Yeo

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)127-138
Number of pages12
JournalQuaestiones Mathematicae
Issue number1
Publication statusPublished - Jan 2014


  • Transversals
  • hypergraphs
  • matchings
  • projective plane

ASJC Scopus subject areas

  • Mathematics (miscellaneous)


Dive into the research topics of 'Matching critical intersection hypergraphs'. Together they form a unique fingerprint.

Cite this