English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper, originally written in Hungarian by D\'{e}nes K\H{o}nig in 1931,proves that in a bipartite graph, the minimum vertex cover and the maximummatching have the same size. This statement is now known as K\H{o}nig'stheorem. The paper also discusses the connection of graphs and matrices, thenmakes some observations about the combinatorial properties of the latter.

Graphs and matrices: A translation of "Graphok \'{e}s matrixok" by D\'{e}nes K\H{o}nig (1931)