Valery A. Liskovets is a member of National Academy of Sciences of Belarus. He solved the problems of enumeration of strongly connected digraphs and directed acyclic graphs, which sparkled a lot of research in this direction afterwards by Robinson, Gessel, Wright and others. He remains active ever since and made contributions to enumeration of automata, maps, unlabelled enumeration schemes, and finite groups.
In early 2019, Valery Liskovets presented me several author copies of his early research papers from 1969 to 1977 published in rare venues. These works are quite difficult to find elsewhere, but still play an important role in the enumeration of graphic structures. I went to ask for his permission to share these works publicly, which he kindly provided.
Some results of combinatorial theory of graph enumeration. I
Combinatorial and asymptotic analysis. Krasnoyarsk State University, 1975
Rus: Некоторые результаты комбинаторной теории перечисления графов. I
Комбинаторный и асимптотический анализ. Красноярский государственный университет, 1975.
- 1975-Liskovets-some-results.pdf (3876.7 KB)
the construction of this page is in progress: not all the papers are scanned yet, maybe some of the papers will get translated in the future…