Skip to search formSkip to main contentSkip to account menu

König's lemma

Known as: König, König's infinity lemma, König lemma 
König's lemma or König's infinity lemma is a theorem in graph theory due to Dénes Kőnig (). It gives a sufficient condition for an infinite graph to… 
Wikipedia (opens in a new tab)

Related topics

Related topics

21 relations
Analytical hierarchyArithmetical hierarchyAronszajn treeDe Bruijn–Erdős theorem (graph theory)

Broader (1)

Computability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Scheduling in Computer and Manufacturing Systems
Scheduling with Large Communication Delays by EVRIPIDISBAMPIS(joint Work with Jean-Claude König) We consider a task graph model… 
Review
2011
Review
2011
The Convective and Orographically‐induced Precipitation Study (COPS): the scientific strategy, the field phase, and research highlights
Within the framework of the international field campaign COPS (Convective and Orographically‐induced Precipitation Study), a… 
Highly Cited
2011
Highly Cited
2011
Open Questions in Reverse Mathematics
Abstract We present a list of open questions in reverse mathematics, including some relevant background information for each… 
Highly Cited
2004
Highly Cited
2004
A new sediment contact assay to assess particle-bound pollutants using zebrafish (danio rerio) embryos
Goal, Scope and Background. Based on a bioassay battery covering only primary producers and consumers as well as degraders, the… 
Highly Cited
1999
Highly Cited
1999
Highly Specific DNA Recognition by a Designed Miniature Protein
Many DNA-binding proteins employ a short R-helix as their primary DNA recognition element.1-5 When removed from their natural… 
Review
1997
Review
1997
USEFUL ESTIMATION PROCEDURES FOR CRITIAL GAPS.
Highly Cited
1991
Highly Cited
1991
König ’ s Lemma
A continuation of [3]. The notion of finite–order trees, succesors of an element of a tree, and chains, levels and branches of a… 
Highly Cited
1990
Highly Cited
1990
Measure theory and weak König's lemma
We develop measure theory in the context of subsystems of second order arithmetic with restricted induction. We introduce a… 
Highly Cited
1976
Highly Cited
1976
Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)
The uniform word problem for commutative semigroups (UWCS) is the problem of determining from any given finite set of defining… 
Highly Cited
1956
Highly Cited
1956
Note on Dilworth’s decomposition theorem for partially ordered sets
Let P be a finite partially ordered set with elements 1, 2, , n and order relation denoted by ">." A chain in P is a set of one… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)