Matching critical intersection hypergraphs

DOI10.2989/16073606.2013.779991zbMATH Open1397.05129OpenAlexW1973270138MaRDI QIDQ2968611FDOQ2968611

Authors: Michael A. Henning, A. Yeo 

Publication date: 20 March 2017

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2013.779991

Recommendations

• Matching criticality in intersecting hypergraphs
• On a criterion for matchability in hypergraphs
• On matchings in hypergraphs
• Intersections of hypergraphs
• On intersecting hypergraphs
• On a hypergraph matching problem
• A condition for matchability in hypergraphs
• Matching graphs of hypercubes and complete bipartite graphs
• Matching graphs of Hypercubes and Complete Bipartite Graphs
• Induced matchings in intersection graphs

zbMATH Keywords

hypergraphsmatchingstransversalsprojective plane

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (4)

• Critical hypergraphs and interesting set-pair systems
• Domination in intersecting hypergraphs
• The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
• Matching criticality in intersecting hypergraphs

This page was built for publication: Matching critical intersection hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2968611)