Dénes Kőnig was a Hungarian mathematician known for his contributions to graph theory and combinatorics. He was born on January 1, 1930, and made significant advancements in the study of graph theory, particularly in the areas of coloring and matching. Kőnig is best known for Kőnig's theorem, which states that in any bipartite graph, the size of the maximum matching equals the size of the minimum vertex cover. His work has had a lasting impact on both theoretical and applied mathematics, influencing various fields such as computer science and operations research.