Michal Karonski

From MaRDI portal
Person:237439

Available identifiers

zbMath Open karonski.michalMaRDI QIDQ237439

List of research outcomes





PublicationDate of PublicationType
Random Graphs and Networks: A First Course2023-01-30Paper
Random intersection graph process2021-04-26Paper
Ronald Louis Graham (1935 ‐ 2020)2020-11-30Paper
Corrigendum to: ``Existence of a perfect matching in a random \((1+e^{-1})\)-out bipartite graph2020-04-22Paper
On a perfect matching in a random bipartite digraph with average out-degree below two2019-03-13Paper
The 1-2-3-conjecture for hypergraphs2017-08-08Paper
Properties of stochastic Kronecker graphs2015-11-10Paper
Introduction to Random Graphs2015-10-05Paper
A faster distributed algorithm for computing maximal matchings deterministically2015-09-11Paper
Random intersection graph process2015-01-13Paper
A new upper bound for the irregularity strength of graphs2012-03-15Paper
Total Vertex Irregularity Strength of Forests2011-03-10Paper
Vertex coloring edge weightings with integer weights at most 62011-01-06Paper
An iterative approach to graph irregularity strength2010-10-11Paper
Vertex-coloring edge-weightings: towards the 1-2-3-conjecture2010-04-21Paper
The degree of a typical vertex in generalized random intersection graph models2006-10-19Paper
On Generalized Random Railways2004-09-07Paper
Edge weights and vertex colours2004-08-06Paper
Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph2003-08-25Paper
On graph irregularity strength2003-03-19Paper
https://portal.mardi4nfdi.de/entity/Q47961862003-03-02Paper
The phase transition in a random hypergraph2002-08-22Paper
On the distributed complexity of computing maximal matchings2002-04-23Paper
On a solution of a randomized three tracks variant of the Gate Matrix Layout problem2002-03-20Paper
On Perfect Matchings and Hamilton Cycles in Sums of Random Trees1999-06-27Paper
https://portal.mardi4nfdi.de/entity/Q42501851999-06-17Paper
On Random Intersection Graphs: The Subgraph Problem1999-05-11Paper
The number of connected sparsely edged uniform hypergraphs1997-11-10Paper
https://portal.mardi4nfdi.de/entity/Q27855641997-02-25Paper
https://portal.mardi4nfdi.de/entity/Q48717541996-08-26Paper
https://portal.mardi4nfdi.de/entity/Q48786651996-05-14Paper
On the connectivity of graphs generated by a sum of random mappings1994-02-24Paper
Small cliques in random graphs1990-01-01Paper
A central limit theorem for decomposable random variables with applications to random graphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32030511989-01-01Paper
Poisson convergence and semi-induced properties of random graphs1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32228871984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33330791983-01-01Paper
On 4‐cycles in random bipartite tournaments1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33106541983-01-01Paper
A review of random graphs1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33113761982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39150271981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38792551980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39446391980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41564671977-01-01Paper

Research outcomes over time

This page was built for person: Michal Karonski