Matchings and Covers of Multipartite Hypergraphs

  • Ahmad Abu-Khazneh
  • Published 2016


König’s theorem is a classic result in combinatorics which states that for every bipartite graph G, the cover number of G (denoted by τ(G)) is equal to its matching number (denoted by ν(G)). The theorem’s importance stems from its many applications in various areas of mathematics, such as optimisation theory and algorithmic analysis. Ryser’s Conjecture for… (More)


9 Figures and Tables

Slides referencing similar topics