AI Chat AI Image Generator AI Video Text to Speech

Graphs and matrices: A translation of "Graphok és matrixok" by Dénes Kőnig (1931)

09/05/2020

∙

by Gábor Szárnyas, et al.

∙

∙

This paper, originally written in Hungarian by Dénes Kőnig in 1931, proves that in a bipartite graph, the minimum vertex cover and the maximum matching have the same size. This statement is now known as Kőnig's theorem. The paper also discusses the connection of graphs and matrices, then makes some observations about the combinatorial properties of the latter.

research

∙ 04/18/2020

Mapping Matchings to Minimum Vertex Covers: Kőnig's Theorem Revisited

It is a celebrated result in early combinatorics that, in bipartite grap...

0 Jacob Turner, et al. ∙

research

∙ 11/19/2020

Approximate Bipartite Vertex Cover in the CONGEST Model

We give efficient distributed algorithms for the minimum vertex cover pr...

0 Salwa Faour, et al. ∙

research

∙ 09/18/2019

A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs

The paper presents a polynomial time approximation schema for the edge-w...

0 Vangelis Th. Paschos, et al. ∙

research

∙ 12/19/2022

Excluding Single-Crossing Matching Minors in Bipartite Graphs

By a seminal result of Valiant, computing the permanent of (0,1)-matrice...

0 Archontia C. Giannopoulou, et al. ∙

research

∙ 04/17/2022

Optimally Reconfiguring List and Correspondence Colourings

The reconfiguration graph 𝒞_k(G) for the k-colourings of a graph G has a...

0 Stijn Cambie, et al. ∙

research

∙ 01/19/2019

An Optimal Vector Clock Algorithm for Multithreaded Systems

Tracking causality (or happened-before relation) between events is usefu...

0 Xiong Zheng, et al. ∙

research

∙ 01/24/2020

A Combinatorial View of the Service Rates of Codes Problem, its Equivalence to Fractional Matching and its Connection with Batch Codes

We propose a novel technique for constructing a graph representation of ...

0 Fatemeh Kazemi, et al. ∙