Michał Karoński
Michał Karoński
Unknown affiliation
Verified email at amu.edu.pl
TitleCited byYear
Edge weights and vertex colours
M Karoński, T Łuczak, A Thomason
Journal of Combinatorial Theory, Series B 1 (91), 151-157, 2004
3132004
Introduction to random graphs
A Frieze, M Karoński
Cambridge University Press, 2016
2532016
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
2071999
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
1932010
On the distributed complexity of computing maximal matchings
M Hanckowiak, M Karonski, A Panconesi
SIAM Journal on Discrete Mathematics 15 (1), 41-57, 2001
1492001
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
1421989
On graph irregularity strength
A Frieze, RJ Gould, M Karoński, F Pfender
Journal of Graph Theory 41 (2), 120-137, 2002
1362002
A review of random graphs
M Karoński
Journal of Graph Theory 6 (4), 349-389, 1982
1271982
The phase transition in a random hypergraph
M Karoński, T Łuczak
Journal of Computational and Applied Mathematics 142 (1), 125-135, 2002
802002
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
742011
On the number of strictly balanced subgraphs of a random graph
M Karoński, A Ruciński
Graph theory, 79-83, 1983
541983
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
442006
The origins of the theory of random graphs
M Karoński, A Ruciński
The mathematics of Paul Erdös I, 311-336, 1997
371997
Random graphs
M Karonski
Handbook of combinatorics 1, 351-380, 1995
311995
Random hypergraphs
M Karonski, T Luczak
Combinatorics, Paul Erdos is eighty 2, 283-293, 1996
301996
A faster distributed algorithm for computing maximal matchings deterministically
M Hanckowiak, M Karonski, A Panconesi
291999
Distributed O(Δ log n)-Edge-Coloring Algorithm
A Czygrinow, M Hańćkowiak, M Karoński
European Symposium on Algorithms, 345-355, 2001
272001
Balanced subgraphs of large random graphs
M Karoński
UAM, 1984
271984
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
231987
Small cliques in random graphs
AD Barbour, S Janson, M Karoński, A Ruciński
Random Structures & Algorithms 1 (4), 403-434, 1990
161990
The system can't perform the operation now. Try again later.
Articles 1–20