Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,206,257 papers from all fields of science
Search
Sign In
Create Free Account
Kőnig's theorem (graph theory)
Known as:
König
, König's theorem (graph theory)
, Koenig theorem (graph theory)
Expand
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
Create Alert
Alert
Related topics
Related topics
15 relations
Approximation algorithm
Clique (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
Isabel Beckenbach
,
R. Borndörfer
Discret. Math.
2018
Corpus ID: 52067804
2010
2010
PARAMETERIZING FROM THE EXTREMES: FEASIBLE PARAMETERIZATIONS OF SOME NP-OPTIMIZATION PROBLEMS
S. Sikdar
2010
Corpus ID: 123567464
Parameterized complexity is a newly developed sub-area of computational complexity that allows for a more refined analysis of…
Expand
Review
2008
Review
2008
2 of Combinatorial Optimization : Packing and Covering
W. Gasarch
,
B. Schröder
,
J. Cohen
,
G. Lalitha
2008
Corpus ID: 599361
In this column we review the following books. (b) The congruences of a finite lattice: a proof-by picture approach Also by George…
Expand
2003
2003
On alpha+-stable Ko"nig-Egerváry graphs
Vadim E. Levit
,
Eugen Mandrescu
Discret. Math.
2003
Corpus ID: 33687263
2002
2002
A Tree Version of Kőnig's Theorem
R. Aharoni
,
E. Berger
,
R. Ziv
Comb.
2002
Corpus ID: 38277360
Kőnig's theorem states that the covering number and the matching number of a bipartite graph are equal. We prove a generalization…
Expand
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