43746
In a bipartite graph with no isolated vertices , the number of vertices in a maximum independent set equals the number of edges in a minimum edge covering ; this is Kőnig 's theorem .
 person: Kőnig
Given options, please tell me the categories of all the listed entity words.Output format is "type1: word1; type2: word2". 
Option: location, person, organization 
Text: {0} 
 Entities: Kőnig 
Answer:
 person: Kőnig