Anton Kotzig (1919 to 1991) was a Slovak and Canadian mathematician who worked in combinatorics, graph theory and mathematical statistics. Born in the village of Kočovce in western Slovakia, he took his doctorate in mathematical statistics at Comenius University in Bratislava in 1943, spent years applying mathematics to social insurance and economic planning, and served as rector of the University of Economics in Bratislava from 1952 to 1958. He then headed the newly created Mathematical Institute of the Slovak Academy of Sciences and established what is known as the Slovak School of Graph Theory. In 1969 he moved to Canada, and from 1970 he worked at the Centre de recherches mathematiques and the University of Montreal until his death. His name is attached to Kotzig's theorem on the degrees of edge endpoints in polyhedral graphs, to the Kotzig transformation, and, with Gerhard Ringel, to the still unsolved Ringel-Kotzig conjecture that every tree has a graceful labeling.
Facts
Connections
In Branch
Source Anton Kotzig (Wikipedia)
Source Anton Kotzig (Wikipedia)
Principal Result
Source Anton Kotzig (Wikipedia)
Proofs Credited
Source Kotzig's theorem, Wikipedia
In the Other Atlases
Nationality
Also in Geography Atlas: the nationality of this subject.
Source Anton Kotzig (Wikipedia)Biography, move to CanadaQuote, Biography, move to Canada
In 1969, Kotzig moved to Canada and spent a year at the University of Calgary.
Also in Geography Atlas: the nationality of this subject.
Source Anton Kotzig (Wikipedia)Biography, birthQuote, Biography, birth
Kotzig was born in Kočovce, a village in Western Slovakia.
Sources
1. Anton Kotzig (Wikipedia)
Lead, dates
Anton Kotzig (22 October 1919
Biography, family
leaving his wife Edita and son Ľuboš
Biography, birth
Kotzig was born in Kočovce, a village in Western Slovakia.
Biography, move to Canada
In 1969, Kotzig moved to Canada and spent a year at the University of Calgary.
In Branch: Graph Theory, Lead
expert in statistics, combinatorics and graph theory
In Branch: Combinatorics, Lead
expert in statistics, combinatorics and graph theory
Principal Result: Kotzig's Theorem, Contributions
One of his results, known as Kotzig's Theorem, is the statement that every polyhedral graph has an edge whose two endpoints have total degree at most 13.
View the SourceKotzig's theorem, Wikipedia
Proofs Credited: Kotzig's Theorem, Lead sentenceQuote, Proofs Credited: Kotzig's Theorem, Lead sentence
The result is named after Anton Kotzig, who published it in 1955 in the dual form that every convex polyhedron has two adjacent faces with a total of at most 13 sides.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.