关注
Michał Karoński
Michał Karoński
未知所在单位机构
在 amu.edu.pl 的电子邮件经过验证
标题
引用次数
引用次数
年份
Introduction to random graphs
A Frieze, M Karoński
Cambridge University Press, 2016
8052016
Edge weights and vertex colours
M Karoński, T Łuczak, A Thomason
Journal of Combinatorial Theory Series B 91 (1), 151-157, 2004
4142004
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
2602010
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
2501999
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
1991989
On graph irregularity strength
A Frieze, RJ Gould, M Karoński, F Pfender
Journal of graph theory 41 (2), 120-137, 2002
1952002
On the distributed complexity of computing maximal matchings
M Hanckowiak, M Karonski, A Panconesi
SIAM Journal on Discrete Mathematics 15 (1), 41-57, 2001
1892001
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
1342011
A review of random graphs
M Karoński
Journal of Graph Theory 6 (4), 349-389, 1982
1341982
The phase transition in a random hypergraph
M Karoński, T Łuczak
Journal of Computational and Applied Mathematics 142 (1), 125-135, 2002
1282002
On the number of strictly balanced subgraphs of a random graph
M Karoński, A Ruciński
Graph Theory: Proceedings of a Conference held in Łagów, Poland, February 10 …, 1983
651983
The origins of the theory of random graphs
M Karoński, A Ruciński
The Mathematics of Paul Erdös I, 311-336, 1997
521997
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
462006
Random graphs
M Karonski
Handbook of combinatorics 1, 351-380, 1995
361995
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
341999
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
331987
Distributed O(Δ log n)-Edge-Coloring Algorithm
A Czygrinow, M Hańćkowiak, M Karoński
Algorithms—ESA 2001: 9th Annual European Symposium Århus, Denmark, August …, 2001
322001
Balanced subgraphs of large random graphs
M Karoński
UAM, 1984
251984
An iterative approach to graph irregularity strength
M Ferrara, R Gould, M Karoński, F Pfender
Discrete applied mathematics 158 (11), 1189-1194, 2010
202010
Small cliques in random graphs
AD Barbour, S Janson, M Karoński, A Ruciński
Random Structures & Algorithms 1 (4), 403-434, 1990
201990
系统目前无法执行此操作,请稍后再试。
文章 1–20