3 citations · 3 across the 1 of their papers we have counts for
2 papers
math.CO2013★ 3 cited
The 1-2-3 Conjecture for Hypergraphs
Maciej Kalkowski, Michał Karoński, Florian Pfender
A weighting of the edges of a hypergraph is called vertex-coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e., every edge contains at least…
math.PR2013
Random intersection graph process
Mindaugas Bloznelis, Michal Karonski
We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks that admit tunable (power law) degree distribution and assortativity and clu…