Michał Karoński

2.3k total citations · 1 hit paper
30 papers, 1.1k citations indexed

About

Michał Karoński is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Michał Karoński has authored 30 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Computational Theory and Mathematics, 13 papers in Discrete Mathematics and Combinatorics and 9 papers in Geometry and Topology. Recurrent topics in Michał Karoński's work include Limits and Structures in Graph Theory (13 papers), Advanced Graph Theory Research (11 papers) and Graph theory and applications (9 papers). Michał Karoński is often cited by papers focused on Limits and Structures in Graph Theory (13 papers), Advanced Graph Theory Research (11 papers) and Graph theory and applications (9 papers). Michał Karoński collaborates with scholars based in Poland, United States and United Kingdom. Michał Karoński's co-authors include Alan Frieze, Tomasz Łuczak, Andrew Thomason, Florian Pfender, Alessandro Panconesi, Michał Hańćkowiak, Edward R. Scheinerman, Andrzej Ruciński, A. D. Barbour and Ronald J. Gould and has published in prestigious journals such as Journal of Computational and Applied Mathematics, Journal of Molecular Structure and Mathematical Proceedings of the Cambridge Philosophical Society.

In The Last Decade

Michał Karoński

29 papers receiving 1.0k citations

Hit Papers

Introduction to Random Graphs 2015 2026 2018 2022 2015 50 100 150 200
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Introduction to Random Graphs
    2015 236 citations Alan Frieze, Michał Karoński Cambridge University Press eBooks profile →

Peers

Michał Karoński
B Bollobás United States
N. C. Wormald Australia
József Beck United States
Emeric Deutsch United States
L. H. Harper United States
Dragomir Ž. Djoković Canada
Shaun Fallat Canada
Marc Noy Spain
Eyal Lubetzky United States
Bruce A. Reed Canada
B Bollobás United States
Michał Karoński
Citations per year, relative to Michał Karoński Michał Karoński (= 1×) peers B Bollobás

Countries citing papers authored by Michał Karoński

Since Specialization
Citations

This map shows the geographic impact of Michał Karoński's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michał Karoński with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michał Karoński more than expected).

Fields of papers citing papers by Michał Karoński

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michał Karoński. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michał Karoński. The network helps show where Michał Karoński may publish in the future.

Co-authorship network of co-authors of Michał Karoński

This figure shows the co-authorship network connecting the top 25 collaborators of Michał Karoński. A scholar is included among the top collaborators of Michał Karoński based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michał Karoński. Michał Karoński is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Frieze, Alan & Michał Karoński. (2023). Random Graphs and Networks: A First Course. Cambridge University Press eBooks. 3 indexed citations
2.
Karoński, Michał, et al.. (2020). On a perfect matching in a random digraph with average out-degree below two. Journal of Combinatorial Theory Series B. 143. 226–258. 5 indexed citations
3.
Karoński, Michał, et al.. (2016). The 1-2-3-Conjecture for Hypergraphs. Journal of Graph Theory. 85(3). 706–715. 4 indexed citations
4.
Kang, Mihyun, et al.. (2015). Properties of stochastic Kronecker graphs. 6(4). 395–432.
5.
Frieze, Alan & Michał Karoński. (2015). Introduction to Random Graphs. Cambridge University Press eBooks. 236 indexed citations breakdown →
6.
Karoński, Michał, et al.. (2009). Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture. Journal of Combinatorial Theory Series B. 100(3). 347–349. 136 indexed citations
7.
Jaworski, Jerzy, Michał Karoński, & Dudley Stark. (2006). The degree of a typical vertex in generalized random intersection graph models. Discrete Mathematics. 306(18). 2152–2165. 19 indexed citations
8.
Karoński, Michał, Tomasz Łuczak, & Andrew Thomason. (2004). Edge weights and vertex colours. Journal of Combinatorial Theory Series B. 91(1). 151–157. 203 indexed citations
9.
Karoński, Michał & Boris Pittel. (2003). Existence of a perfect matching in a random (1+e−1)—out bipartite graph. Journal of Combinatorial Theory Series B. 88(1). 1–16. 6 indexed citations
10.
Karoński, Michał & Tomasz Łuczak. (2002). The phase transition in a random hypergraph. Journal of Computational and Applied Mathematics. 142(1). 125–135. 45 indexed citations
11.
Czygrinow, Andrzej, et al.. (2001). Distributed O(Delta log(n))-Edge-Coloring Algorithm. European Symposium on Algorithms. 345–355. 9 indexed citations
12.
Hańćkowiak, Michał, Michał Karoński, & Alessandro Panconesi. (2001). On the Distributed Complexity of Computing Maximal Matchings. SIAM Journal on Discrete Mathematics. 15(1). 41–57. 68 indexed citations
13.
Karoński, Michał, et al.. (1999). On Random Intersection Graphs: The Subgraph Problem. Combinatorics Probability Computing. 8(1-2). 131–159. 101 indexed citations
14.
Frieze, Alan, et al.. (1999). On Perfect Matchings and Hamilton Cycles in Sums of Random Trees. SIAM Journal on Discrete Mathematics. 12(2). 208–216. 2 indexed citations
15.
Hańćkowiak, Michał, Michał Karoński, & Alessandro Panconesi. (1998). On the distributed complexity of computing maximal matchings. Symposium on Discrete Algorithms. 219–225. 18 indexed citations
16.
Hańćkowiak, Michał, Michał Karoński, & Alessandro Panconesi. (1997). On the Distributed Complexity of Computing Maximal Matchings. BRICS Report Series. 4(38). 19 indexed citations
17.
Karoński, Michał & Joel Spencer. (1995). Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science. 2 indexed citations
18.
Jaworski, Jerzy & Michał Karoński. (1993). On the connectivity of graphs generated by a sum of random mappings. Journal of Graph Theory. 17(2). 135–150. 3 indexed citations
19.
Barbour, A. D., Michał Karoński, & Andrzej Ruciński. (1989). A central limit theorem for decomposable random variables with applications to random graphs. Journal of Combinatorial Theory Series B. 47(2). 125–145. 75 indexed citations
20.
Karoński, Michał, et al.. (1985). Random graphs '83. North-Holland eBooks. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by B Bollobás Breakdown of academic impact, for papers by N. C. Wormald Breakdown of academic impact, for papers by József Beck Breakdown of academic impact, for papers by Emeric Deutsch Breakdown of academic impact, for papers by L. H. Harper Breakdown of academic impact, for papers by Dragomir Ž. Djoković Breakdown of academic impact, for papers by Shaun Fallat Breakdown of academic impact, for papers by Marc Noy Breakdown of academic impact, for papers by Eyal Lubetzky Breakdown of academic impact, for papers by Bruce A. Reed
Rankless by CCL
2026