| Introduction to random graphs A Frieze, M Karoński Cambridge University Press, 2016 | 552 | 2016 |
| Edge weights and vertex colours M Karoński, T Łuczak, A Thomason Journal of Combinatorial Theory, Series B 91 (1), 151-157, 2004 | 378 | 2004 |
| Vertex-coloring edge-weightings: towards the 1-2-3-conjecture M Kalkowski, M Karoński, F Pfender Journal of Combinatorial Theory, Series B 100 (3), 347-349, 2010 | 242 | 2010 |
| On random intersection graphs: The subgraph problem M Karoński, ER Scheinerman, KB Singer-Cohen Combinatorics, Probability and Computing 8 (1-2), 131-159, 1999 | 234 | 1999 |
| On the distributed complexity of computing maximal matchings M Hanckowiak, M Karonski, A Panconesi SIAM Journal on Discrete Mathematics 15 (1), 41-57, 2001 | 177 | 2001 |
| A central limit theorem for decomposable random variables with applications to random graphs AD Barbour, M Karoński, A Ruciński Journal of Combinatorial Theory, Series B 47 (2), 125-145, 1989 | 173 | 1989 |
| On graph irregularity strength A Frieze, RJ Gould, M Karoński, F Pfender Journal of Graph Theory 41 (2), 120-137, 2002 | 170 | 2002 |
| A review of random graphs M Karoński Journal of Graph Theory 6 (4), 349-389, 1982 | 133 | 1982 |
| A new upper bound for the irregularity strength of graphs M Kalkowski, M Karoński, F Pfender SIAM journal on discrete mathematics 25 (3), 1319-1321, 2011 | 108 | 2011 |
| The phase transition in a random hypergraph M Karoński, T Łuczak Journal of Computational and Applied Mathematics 142 (1), 125-135, 2002 | 92 | 2002 |
| On the number of strictly balanced subgraphs of a random graph M Karoński, A Ruciński Graph theory, 79-83, 1983 | 61 | 1983 |
| The degree of a typical vertex in generalized random intersection graph models J Jaworski, M Karoński, D Stark Discrete Mathematics 306 (18), 2152-2165, 2006 | 46 | 2006 |
| The origins of the theory of random graphs M Karoński, A Ruciński The mathematics of Paul Erdös I, 311-336, 1997 | 43 | 1997 |
| Random graphs M Karonski Handbook of combinatorics 1, 351-380, 1995 | 35* | 1995 |
| A faster distributed algorithm for computing maximal matchings deterministically M Hańćkowiak, M Karoński, A Panconesi Proceedings of the eighteenth annual ACM symposium on Principles of …, 1999 | 34 | 1999 |
| Random hypergraphs M Karonski, T Luczak Combinatorics, Paul Erdos is eighty 2, 283-293, 1996 | 33 | 1996 |
| Distributed O(Δ log n)-Edge-Coloring Algorithm A Czygrinow, M Hańćkowiak, M Karoński European Symposium on Algorithms, 345-355, 2001 | 31 | 2001 |
| Poisson convergence and semi-induced properties of random graphs M Karoński, A Ruciński Mathematical Proceedings of the Cambridge Philosophical Society 101 (2), 291-300, 1987 | 27 | 1987 |
| Balanced subgraphs of large random graphs M Karoński UAM, 1984 | 23 | 1984 |
| Existence of a perfect matching in a random (1+ e− 1)—out bipartite graph M Karoński, B Pittel Journal of Combinatorial Theory, Series B 88 (1), 1-16, 2003 | 18 | 2003 |
Florian PfenderProfessor for Mathematics, University of Colorado DenverZweryfikowany adres z ucdenver.edu
