alphaFeedback
KR

Katarzyna Rybarczyk

math.COmath.PRcs.SI

On Valency

published · living versions
W_pjcc7xnm·v1 · currentpublished

Preprints & journals

14 papers in the corpus · 2009–2026
Subgraph probabilities in random intersection graphs2610.27117v1 · Katarzyna Rybarczyk, Grzegorz Serafin2026 · 0 citationsarXiv
Note on edge expansion and modularity in preferential attachment graphs2601.05953v1 · Colin McDiarmid, Katarzyna Rybarczyk, Fiona Skerman et al.2026 · 0 citationsarXiv
New bounds on the modularity of G(n,p)G(n,p)2504.16254v1 · Katarzyna Rybarczyk, Ma\lgorzata Sulkowska2025 · 0 citationsarXiv
Modularity of random intersection graphs2502.05488v1 · Katarzyna Rybarczyk2025 · 0 citationsarXiv
Modularity of preferential attachment graphs2501.06771v4 · Katarzyna Rybarczyk, Ma\lgorzata Sulkowska2025 · 0 citationsarXiv
The cover time of a sparse random intersection graph1910.09639v2 · Mindaugas Bloznelis, Jerzy Jaworski, Katarzyna Rybarczyk2019 · 2 citationsarXiv
Finding Hamilton cycles in random intersection graphs1702.03667v3 · Katarzyna Rybarczyk2017 · 2 citationsDiscrete Mathematics & Theoretical Computer Science, Vol. 20 no. 1, Graph Theory (March 5, 2018) dmtcs:3144
Poisson approximation of counts of subgraphs in random intersection graphs1609.01699v1 · Katarzyna Rybarczyk, Dudley Stark2016 · 0 citationsarXiv
The coupling method for inhomogeneous random intersection graphs1301.0466v4 · K. Rybarczyk2013 · 39 citationsThe Electronic Jourlal of Combinatorics, 24 (2), P2.10 (pp. 45), 2017
Equivalence of the random intersection graph and G(n,p)0910.5311v2 · Katarzyna Rybarczyk2009 · 33 citationsRandom Structures and Algorithms, 38, 205-234, 2011
Sharp threshold functions for the random intersection graph via coupling method?0910.0749v2 · Katarzyna Rybarczyk2009 · 24 citationsThe Electronic Journal of Combinatorics, 18(1), P36, 2011
Career total: 45 works. 14 are in this corpus.

Profile built from the corpus for this byline.

Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.