Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Kőnig's theorem (graph theory)

Known as: König, König's theorem (graph theory), Koenig theorem (graph theory) 
In the mathematical area of graph theory, König's theorem, proved by Dénes Kőnig (), describes an equivalence between the maximum matching problem… Expand
Wikipedia

Related topics

Related topics

15 relations
Approximation algorithmClique (graph theory)Degree (graph theory)Distributed algorithm
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Hall's and Kőnig's theorem in graphs and hypergraphs
Abstract We investigate the relation between Hall’s theorem and Kőnig’s theorem in graphs and hypergraphs. In particular, we… Expand
Is this relevant?
2010
2010
PARAMETERIZING FROM THE EXTREMES: FEASIBLE PARAMETERIZATIONS OF SOME NP-OPTIMIZATION PROBLEMS
Parameterized complexity is a newly developed sub-area of computational complexity that allows for a more refined analysis of… Expand
  • table 1.1
  • figure 4.2
  • figure 4.3
  • figure 5.1
  • table 5.1
Is this relevant?
Review
2008
Review
2008
2 of Combinatorial Optimization : Packing and Covering
In this column we review the following books. (b) The congruences of a finite lattice: a proof-by picture approach Also by George… Expand
Is this relevant?
2003
2003
On alpha+-stable Ko"nig-Egerváry graphs
The stability number of a graph G, denoted by α(G), is the cardinality of a stable set of maximum size in G. If its stability… Expand
Is this relevant?
2002
2002
A Tree Version of Kőnig's Theorem
Kőnig's theorem states that the covering number and the matching number of a bipartite graph are equal. We prove a generalization… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE