3 citations · 5 across the 3 of their papers we have counts for
3 papers
math.CO2019★ 1 cited
On a perfect matching in a random bipartite digraph with average out-degree below two
Michal Karoński, Ed Overman, Boris Pittel
Existence of a perfect matching in a random bipartite digraph with bipartition , , is studied. The graph is generated in two rounds of random selections of a p…
math.CO2014★ 1 cited
Properties of stochastic Kronecker graphs
Mihyun Kang, Michał Karoński, Christoph Koch +1
The stochastic Kronecker graph model introduced by Leskovec et al. is a random graph with vertex set , where two vertices and are connected with probability…
math.CO2011★ 3 cited
Total Vertex Irregularity Strength of Forests
Marcin Anholcer, Michał Karoński, Florian Pfender
We investigate a graph parameter called the total vertex irregularity strength (), i.e. the minimal such that there is a labeling $w: E(G)\cup V(G)\rightarrow \{1,2,..,…