Anton Kotzig

[1] He remained in Bratislava working at the Central Bureau of Social Insurance for Slovakia as head of the Department of Mathematical Statistics.

From 1951 to 1959, he lectured at Vysoká škola Ekonomická (today University of Economics in Bratislava), where he served as rector from 1952 to 1958.

In 1959, he left the University of Economics to become head of the newly-created Mathematical Institute of the Slovak Academy of Sciences, where he remained until 1964.

From 1965 to 1969, he was head of the department of the Applied Mathematics on Faculty of the Natural Sciences of Comenius University, where he was also dean for one year.

Because of the political situation, he could not travel back to Czechoslovakia, and remained in his adopted country without his books and notes.

His publications cover a wide range of topics in graph theory and combinatorics: convex polyhedra, quasigroups, special decompositions into Hamiltonian paths, Latin squares, decompositions of complete graphs, perfect systems of difference sets, additive sequences of permutations, tournaments and combinatorial games theory.

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.

In honor of Kotzig's 60th birthday, Alexander Rosa, Gert Sabidussi and Jean Turgeon edited a festschrift, Theory and Practice of Combinatorics: A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday (Annals of Discrete Mathematics 12, North-Holland, 1982), with contributions from experts from around the world.

The triakis icosahedron , a polyhedron in which every edge has endpoints with total degree at least 13