Michał Karoński is a Professor of Mathematics at the Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland, and serves as head of the Department of Discrete Mathematics. He has held visiting professorships at Emory University, The Johns Hopkins University, Purdue University, and Southern Methodist University since 1975, with ongoing engagements at Emory University since 1992. Research Focus: Discrete mathematics, random discrete structures, graph theory, and theoretical computer science. Leadership Roles: Editor-in-Chief of Random Structures & Algorithms (since 1990), Chairman of the Council of National Science Centre (2010–2016), and organizer of 17 bi-annual conferences on random structures. His research group in random structures gained international recognition in the 1970s. He has authored 60 publications, delivered over 30 plenary lectures, and collaborated globally at institutions like Microsoft Research, Bellcore, and BRICS. Scientific Awards: 2016 Medal 'Homini Vere Academico' (AMU Rector) 2013 Polonia Restituta Officer Cross (President of Poland) 1990 Minister of Science and Higher Education Prize His work spans probabilistic combinatorics, algorithm theory, and graph irregularity, with influential publications on stochastic Kronecker graphs, random intersection graphs, and distributed complexity in matchings.








