___

Andrzej
Ruciñski
Published papers
198184
 The rconnectedness of kpartite random graphs, Bull.de
l'Acad. Pol.
des Sci., 29/78 (1981) 321330.
 Matchings and kfactors in a random graph, Studia
Sci.Math.Hung.
17(1982) 335340.
 On the number of strictly balanced subgraphs of a
random graph (with M.Karo\'nski),
Graph
Theory, Lag\'ow 1981. Lectures Notes in Mathematics, 1018 (1983)
7983.
 The behaviour of $\binom{n}{k,...,k,nik}c^i/i!$ is
asymptotically normal,
Discrete
Mathematics 49 (1984) 287290.
1985
 Subgraphs of random graphs: a general approach, Random
Graphs'83, Annals
of Discrete Math. 28(1985) 221229.
 Every graph is contained in a sparsest possible
balanced graph (with
E.Gy\H ori and B.Rothschild), Math.Proc.Cambr.Phil.Soc.
98(1985)
397401.
 Balanced graphs and the problem of subgraphs
of a random graph with
A.Vince), Proc.16th Southeastern Conf. on Comb. Graph Th. and
Comp., Congressus Numerantium 49 (1985) 181190.
1986
 Random graphs of binomial type with sparsely
edged initial graphs,
Acta
Math.Hung. 47(1986) 8187.
 Strongly balanced graphs and random graphs
(with A.Vince), J.Graph
Theory 10(1986) 251264.
 On a method for random graphs (with Z.Palka
and J.Spencer), Discr.Math.
61(1986),
253258.
 On the order of the largest induced tree in a
random graph (with
Z.Palka), Discr. Appl. Math. 15(1986) 7583.
1987
 Poisson convergence and semiinduced properties
of random graphs
( with M.Karo\'n\ski ), Math.Proc.Cambr.Phil.Soc. 101(1987),
291300.
 Induced subgraphs of a random graph, Annals
Discr.Math. 33(1987)
275296.
1988
 Balanced extensions of graphs and hypergraphs (with
A.Vince), Combinatorica
8 (3) (1988) 279291.
 When are small subgraphs of a random graph
normally distributed?
Prob.Theory
and Related Fields 78(1988) 110.
 Enumeration of the ``upanddown" labellings of a
cycle, Graph Theory
Notes of New York, The New York Academy of Sciences XVI (1988)
2022.
1989
 Small subgraphs of kpartite random graphs (with
M.Karo\'nski), Annals
of the New York Acad. of Sci., 555(1989), 230240.
 Balanced extensions of graphs (with A.Vince), Annals
of the New York
Acad.of Sci., 555(1989), 347351.
 A central limit theorem for decomposable random
variables with applications
to random graphs (with A.Barbour and M.Karo\'nski), JCTB,
47 (2)(1989) 125145.
1990
 A local theorem for generalized Stirling numbers
(with B.Voigt), Rev.
Roum. Math., 35(1990) 161172.
 An exponential bound for the probability of
nonexistence of a specified
subgraph in a random graph (with S.Janson and T.\L uczak), Random
Graphs,
Karonski et al., eds, 1990 Wiley 7388.
 Small subgraphs of random graphsa survey, Random
Graphs, Karonski et
al., eds, 1990 Wiley 283303
pdf
 Small cliques in random graphs (with A.Barbour,
S.Janson and M.Karo\'nski),
Random
Structures \& Algorithms., 1(1990)(4) 403434.
 Maximal graphs with bounded maximum degree:
structure, asymptoticenumeration,
randomness, Proceedings III of 7th Fischland Colloquium,
Rostock.
Math. Kolloq. 41(1990) 4758.
pdf
 Vertex degrees in a random subgraphs of a regular
graph (with Z.Palka),
Studia
Sci.Math.Hung. 25 (1990) 209214.
1991
 From random graphs to graph theory: Ramsey properties
(extended abstract)
Graph
Theory Notes of New York XX (1991) 816
 Treematchings in random graph processes (with T.\L
uczak), SIAM J.Discr.Math.
4
(1991) 107120.
 On convex hulls of graphs, Ars Combinatoria
32 (1991) 293300.
1992
 Proving normality in combinatorics Random Graphs,
A.Frieze and T.Luczak,
eds, 1992 Wiley 215231.
 Convex hulls of dense balanced graphs (with T.\L
uczak) J. of Comput.
Appl. Math. 41 (1992) 205213.
 Balanced extensions of sparse graphs (with T.\L
uczak), IV Czechoslovakian
Symp. on Combinatorics, Graphs and Complexity, J.Nesetril and
M.Fiedler,
eds.,1992 Elsevier Science Publ. 191203.
 Matching and covering the vertices of a random graph
by copies of a given
graph, Discrete Mathematics 105 (1992) 185197.
 Ramsey properties of random graphs (with T.\L uczak
and B.Voigt), JCTB.
56
(1992) 5568.
 Random graph processes with degree restrictions (with
N. Wormald) Combinatorics,
Probability and Computing 1 (1992) 169180.
pdf
1993
 From random graphs to graph theory (survey paper) Quo
Vadis, Graph Theory?,
Annals of Discrete Mathematics 55 (1993) 265274
 The solution to an extremal problem on balanced
extensions of graphs (with
A.Vince) JGT 17 (1993) 417431.
 Lower bounds on probability thresholds for Ramsey
properties (with V. R\"odl)
Combinatorics,
Paul Erd\H os is Eighty, Vol.1, Bolyai Soc. Math. Studies, (1993),
317346.
pdf
1994
 Globally sparse vertexRamsey graphs (with
A.Kurek) J.Graph Theory
18
(1994), 7381.
 Random graphs with monochromatic triangles in every
edge coloring (with
V. R\"odl) Random Structures Algorithms 5(2) (1994), 253270.
 On random graphs (with Z. Palka) Wiadomosci
Matematyczne XXX, (1994)
175197. (In Polish).
1995
 Threshold
functions for Ramsey properties (with V.R\"odl) J. Americ.
Mathem. Soc 8(4) 1995, 917942.
pdf
1996
 On the evolution of a random tournament (with T.\L
uczak and J. Gruszka)
Discrete
Mathematics 148 (1996) 311316.
 Recent developments in random graphs, 35 pages, Proceedings
of
the International Summer School on Probability and Statistics, Varna
1994 pdf
 On Schur properties of random subsets of integers
(with R. Graham and V.
R\"odl) Journal of Number Theory, 61(2) (1996) 388408
pdf
1997
 The origins of the theory of random graphs (with M.
Karonski) in:
Mathematics of Paul Erd\H os; Graham, Ne\v set\v ril, eds.,
Springer,
1997, 311336. pdf

A note on local colorings of graphs (with M.
Truszczynski) Discrete
Mathematics [ Proceedings of Graph Theory, Zakopane 1994; eds. P.
Wojda,
M. Wo\'zniak; Discrete Mathematics] 164 13 (1997) 251255.
pdf
 Rado partition theorem for random subsets of integers
(with V. R\"odl)
Proceedings
of the London Mathematical Society 74(3) (1997) 481502. pdf
 Bipartite coverings of graphs (with V. R\"odl) Combinatorics,
Probability
and Computing 6(3) (1997) 349353. pdf
 Random graph processes with maximum degree 2 (with N.
Wormald) The
Annals of Applied Probability 7(1) (1997) 183199 pdf
1998
 Endomorphisms of partially ordered sets (with
D.Duffus, T.\L uczak and
V.R\"odl) Combinatorics, Probability and Computing 7 (1998)
114 pdf
 Ramsey properties of random hypergraphs (with V.
R\"odl) Journal Combin.
Theory, Series A 81 (1998) 133 pdf

Perfect matchings in $\epsilon$regular graphs (with
N. Alon and V. R\"odl)
The Electr. J. of Combin. 5(1) (1998) #R13 pdf

An algorithmic embedding of graphs via perfect
matchings (extended
abstract)
(with V. R\"odl and M.Wagner) Randomization and Approximation
Techniques in Computer Science (M. Luby, J. Rolim, and M. Serna, eds.)

Proc. Second Inter.
Workshop RANDOM'98, Barcelona, Spain, October, 1998, LNCS, vol. ~
1518 (1998), 2534, Springer, Berlin. pdf
1999

Perfect matching in $\epsilon$regular graphs and the
Blowup Lemma (with
V. R\"odl) Combinatorica 19 (3) (1999) 437452 pdf

Hypergraph packing and graph embedding (with V.
R\"odl and A. Taraz) Combinatorics,
Probability and Computing 8 (1999) 363376. pdf
2000
 Solitary subgraphs of random graphs (with J.
Kurkowiak) Discrete
Mathematics 213 (2000) 195209
pdf
 UNIVERSALITY AND TOLERANCE (Extended Abstract) (with
N. Alon, M. Capalbo,
Y. Kohayakawa V. R\"odl and E. Szemer\'edi) In Proceedings of the
41st IEEE Annual Symposium on FOCS 1421, (2000) pdf
 On graphs with linear ramsey numbers (with R. Graham
and V. R\"odl) J.
Graph Theory 35 (2000) 176192 pdf
2001
 On minimal vertexFolkman graphs (with T. \L uczak
and S. Urba\'nski)
Discrete Mathematics 236 (13) (2001) 245262
pdf
 On bipartite graphs with linear ramsey numbers (with
R. Graham and V.
R\"odl) Combinatorica 21 (2) (2001) 199209
pdf

Nearoptimum universal graphs for graphs with bounded
degrees (Extended Abstract) (with N. Alon, M. Capalbo, Y. Kohayakawa V.
R\"odl and E. Szemer\'edi) APPROXRANDOM 2001, LNCS 3139 (2001)
170180 pdf
2002

Holes in graphs (with Y. Peng and V. R\"odl)The
Electr. J.
of Combin. 9(1) (2002) #R1 pdf
 Matchings Meeting Quotas and Their Impact on the
Blowup
Lemma (with V. R\"odl and M.Wagner) SIAM J. of Computing, 31(2)
(2001*) 428446 pdf
*
According to SIAM new policy, the year of publication
is the year of electronic publication, and not the year of the print
issue.
 Connectedness of graphs generated by a random
$d$process
(with N. Wormald) Australian J. Math.72(1) (2002) 6785 pdf
 The infamous upper tail (with S. Janson), Random
Structures
Algorithms 20(3) (2002) pdf
 Janson inequality Suplement III, Encyclopedia of
Mathematics, ed: M. Hazewinkel Kluwer Academic Publisher (2002)
216218 pdf

VertexRamsey properties of families of graphs (with
T. \L
uczak and S. Urba\'nski) JCT B 84 (2002) 240248 pdf
 Ramsey properties of families of graphs (with
R.L.Graham, T.{\L}uczak,
V.R{\"o}dl, A.Ruci\'{n}ski) JCT B 86 (2002) 413419 pdf
2003
 Connectedness of the degree bounded star process
(with C.
Greenhill and N. Wormald) Combinatorics Probability and Computing
12 (2003) 269283 pdf

Ramsey
games against a onearmed bandit (with E.Friedgut, Y. Kohayakawa, V.
Rödl
and P. Tetali) Combinatorics, Probability and Computing12 (2003) 515545 pdf
2004
 Random hypergraph processes with degree
restrictions (with C. Greenhill and N. Wormald)
Graphs and Combinatorics20 (2004), issue 3, 319332
pdf
 The deletion method for upper tails (with S. Janson)
Combinatorica 24/4 (2004) 615640 pdf
 Upper tails for subgraph counts in random graphs(with
S. Janson and K. Oleszkiewicz)
Israel J. Math.142 (2004) 6192 pdf
2005

Two variants of the size Ramsey number (with A. Kurek) Discuss. Math. Graph Th. 25 (2005) 141149
pdf
 Planar Ramsey number for small graphs(with A. Dudek) Congr.
Numer.(Boca Raton)pdf
 The generalization of Dirac's theorem for hypergraphs (with V.
R\"odl and E. Szemerédi) Proceedings of the 30th International
Symposium MFCS, Gda\'nsk 2005 SpringerVerlag, LNCS 3618, (2005)
5256 pdf
2006

A sharp threshold for random graphs with a monochromatic triangle in
every edge coloring (with E. Friedgut, V. Rödl and P. Tetali)
Memoirs of the AMS, Vol. 179, No. 845, January 2006, 66 pages
pdf
 The Ramsey number for hypergraph cycles I (with P. Haxell, T. \L
uczak, Y. Peng, V. Rödl, M. Simonovits, J. Skokan) JCT A,
113(2006) 6783
pdf
 A Diractype theorem for 3uniform hypergraphs (with V. Rödl
and E.
Szemerédi) Combinatorics, Probability and Computing
pdf
 Short Paths in QuasiRandom Triple Systems with Sparse Underlying Graphs (with J.
Polcyn, V. Rödl and E. Szemerédi)JCT B 96 (2006) 584607 pdf
 Neighbourdistinguishing edge colorings of random regular graphs (with C. Greenhill)
The Electr. J. Combin. 13(1) (2006) pdf
 Perfect matchings in uniform hypergraphs with large minimum degree
(with V. Rödl
and E. Szemerédi) Europ. J. Combin., special volume (Sudakov) 27
(2006) 13331349
pdf
2007
 Ramsey properties of random $k$partite, $k$uniform hypergraphs (with V. Rödl and M. Schacht) SIAM J. of Discrete Math. 21(2) (2007)
442460
pdf
2008
 An approximate Dirac theorem for $k$uniform hypergraphs (with V. Rödl and E. Szemer\'edi) Combinatorica 28(2) (2008) 229260.pdf
 Universality of random graphs (with D. Dellamonica Jr., Y. Kohayakawa and V. Rödl) Proceedings of the nineteenth annual ACMSIAM Symposium
on Discrete Algorithms San Francisco, CA  2008 (2008) 782788.
pdf
 Planar Ramsey numbers for cycles (with I. Gorgol) Discrete Mathematics 308 (2008) 43894395
pdf
 A note on perfect matchings in uniform hypergraphs with large minimum collective degree
(with V. Rödl, M. Schacht and E. Szemeredi)
Commentationes Mathematicae Universitatis Carolinae 49,4 (2008) 633636.
ps
2009
 The Ramsey number for 3uniform tight hypergraph cycles(with P.
Haxell, T. \L uczak, Y. Peng, V. Rödl, J. Skokan)CPC18 (2009),
165204. pdf
 Perfect matchings in large uniform hypergraphs with large minimum
collective degree(with V. Rödl and E. Szemer\'edi) JCT A 116(3)
(2009) 613636. pdf
 Short paths in $\epsilon$regular pairs and small diameter
decompositions of dense graphs (with J. Polcyn) Discrete Mathematics
309(22) 63756381 (2009)pdf
 The Complexity of Perfect Matching Problems on Dense Hypergraphs (with M. Karpiñski, E. Szymañska)
ISAAC 2009 626636 pdf
2010
 Subhypergraph counts in extremal and random hypergraphs and the
fractional qindependence (with A. Dudek and J. Polcyn) Journal of
Combinatorial Optimization 19 (2010) 184199
pdf

Computational complexity
of the Hamiltonian cycle problem in dense hypergraphs (with M.
Karpiñski and E. Szymañska),
LATIN 2010 662673 pdf

On the number of perfect matchings in random lifts (with C. Greenhill
and S. Janson) CPC19(56) 791 817
pdf
 Computational Complexity of the Perfect Matching Problem in
Hypergraphs with Subcritical Density (with M. Karpiñski, E.
Szymañska) Intern. J. Found. Comp. Sci. 21(6) (2010) 905924
pdf

Diractype questions for hypergraphs  a survey (or more problems
for Endre to solve) (with V. Rödl),
An Irregular Mind (Szemer\'edi is 70), Bolyai
Soc. Math. Studies
21 (2010) 561590
pdf
2011
 Upper tails for counting objects in randomly induced subhypergraphs
and rooted random graphs (with S. Janson)
Arkiv f\"or Matematik 49(1) (2011) 7996
pdf
 Perfect matchings and Hamilton cycles in
hypergraphs with large degrees (with Klas Markström)
Europ. J. Combin. 32(5) (2011) 677687
pdf

Diractype conditions for hamiltonian paths and cycles in
3uniform hypergraphs
(with V. Rödl and E. Szemer\'edi)
Advances in Mathematics 227 (2011) 12251299
pdf
2012

On the maximum number of edges in a triple system not containing a disjoint family of a given size (with P. Frankl and V. Rödl) CPC 21 (2012) 141148
pdf
 An improved upper bound on the density of universal random graphs
(extended abstract)
(with D. Dellamonica Jr., Y. Kohayakawa, V. Rödl)
LATIN 2012, LNCS 7256, pp. 231242, 2012
(pdf)pdf
 Rainbow Hamilton cycles in uniform hypergraphs
(with A. Dudek and A. Frieze)
Electron. J. Combin. 19 (2012) #P46
pdf
 Universality of random graphs
(with D. Dellamonica Jr., Y. Kohayakawa, V. Rödl)
SIAM J. Discrete Math. 26 (2012) 353374
pdf
 Large matchings in uniform hypergraphs
and the conjectures of Erd\H{o}s and Samuels (with N. Alon, P. Frankl, H. Huang, V. Rödl, and B.
Sudakov)
JCT A 119(6) (2012) 12001215.
pdf
 Approximate counting of matchings in sparse uniform hypergraphs
(with M. Karpiñski and E. Szymañska) ANALCO 2013, 7178
(2012) SIAM pdf
2013
 Hamilton saturated hypergraphs of essentially minimum size (with Andrzej ¯ak)
Electron. J. Combin. 20(2) (2013) #P25
pdf
 Approximate counting of regular hypergraphs via switchings
(with: Andrzej Dudek, Alan Frieze, Matas Sileikis)
Inform. Process. Letters 113(1921) 785788
pdf

The origins of the theory of random graphs (with M. Karo\'nski, updated)
in: The Mathematics of Paul Erd\H os; Second Edition; Graham, Ne\v set\v ril, Butler, eds.,
Springer, 2013, 371397.
pdf
 Regular Hypergraphs: Asymptotic Counting and Loose Hamilton Cycles (with: A. Dudek, A. Frieze, M. \v{S}ileikis),
in \textit{The Seventh
European Conference on Combinatorics, Graph Theory and Applications. EuroComb 2013}, eds. J.
Ne\v{s}et\v{r}il and M. Pellegrini, Pisa, Edizioni della Normale2013, 483486.
pdf
2014
 Families of triples with high minimum degree are Hamiltonian
(with V. Rödl)
Discuss. Math.  Graph Th. 34 (2014) 363383
pdf
 Approximate Counting of Matchings in (3,3)Hypergraphs
(with M. Karpinski, A. Dudek, and E. Szymañska)
R. Ravi and I.L. Görtz (Eds.): SWAT 2014, LNCS 8503 (2014) 368379
pdf
2015
 Loose Hamilton Cycles in Regular Hypergraphs
(with: A. Dudek, A. Frieze, M. Sileikis)
CPC
24(1) (2015) 179  194
pdf
 An improved upper bound on the density of universal random graphs
(with D. Delamonica, Y. Kohayakawa, V. Rödl) RSA 46(2) (2015) 274  299
pdf
2016
 Tur\'an Numbers for 3Uniform Linear Paths of Length 3 (with
E. Jackowska and J. Polcyn) Electron. J. Combin. 2 (2016) #P2.30
pdf

Upper bounds on the minimum size of
Hamilton saturated hypergraphs (with A. {\.Z}ak) Electron. J. Combin. 23(4) (2016) \#P4.12
pdf
2017

Refined Tur\'nan numbers and Ramsey numbers for the
loose 3uniform path of length three (with J. Polcyn) Discrete Math.340 (2017) 107118
pdf

Embedding the ErdosRenyi hypergraph into the random regular hypergraph and Hamiltonicity
(with A. Dudek, A. Frieze, M. \v{S}ileikis) J. Combin. Th., Ser. B 122 (2017) 719740
pdf
 An exponentialtype upper bound for Folkman numbers (with V. Rödl and M. Schacht) Combinatorica 37 (4) (2017) 767{784
pdf

On the Hamiltonicity of triple systems with high
minimum degree (with V. Rödl, M. Schacht, and E. Szemeredi) Annals of Combinatorics 21(1) (2017) 95117
pdf

A hierarchy of maximal intersecting triple systems (with J. Polcyn)
Opuscula Math. 37(4) (2017) 597608pdf

A short proof of Erdõs’ conjecture for triple systems (with P. Frankl and V. R\"odl) Acta Mathematica Hungarica 151(2) (2017) 495509 pdf
 Ramsey properties of random graphs and Folkman numbers (with V. Rödl and M. Schacht)
Discuss. Math. Graph Theory 37 (2017) 755–776
pdf
 Ramsey numbers and restricted Tur\'an numbers for the loose 3uniform path of length three (with E. Jackowska and J. Polcyn)
Electron. J. Combin. 24(3) (2017) \#P3.5
pdf
2018
 Constructive Ramsey Numbers For Loose Hyperpaths (with A. Dudek)
LATIN 2018, LNCS 10807 pdf

On multicolor Ramsey numbers for loose kpaths of length three (with T. {\L}uczak and J. Polcyn) Europ. J. Combin. 71 (2018) 4350
pdf
2019
 Monochromatic loose paths in multicolored kuniform cliques (with A. Dudek)
Discr. Math. Theor. Comp. Sci. 21(4) (2019), Paper No. 7, 15 pp.
pdf
 Minimum pairdegree for tight Hamiltonian cycles in 4uniform hypergraphs (with C. Reiher, V. Rödl, M. Schacht, B. Schülke)
Acta Math. Univ. Comenian. (N.S.) 88(3) (2019) 1023–1027
pdf
 Minimum vertex degree condition for tight Hamiltonian cycles in 3uniform hypergraphs (with Chr. Reiher, V. Rödl, M. Schacht, and E. Szemer\'edi)
Proc. Lond. Math. Soc. (3) 119(2) (2019) 409–439
pdf
2020
 Powers of Hamiltonian cycles in randomly augmented Dirac graphs (with A. Dudek, Ch. Reiher, and M. Schacht)
Random Structures Algorithms 56(1) (2020) 122141.
pdf
 Minimum pair vertex degree condition for tight Hamiltonian cycles in 4uniform hypergraphs (with J. Polcyn, Chr. Reiher, V. Rödl, M. Schacht, and B. Schülke)
Acta Math. Hungar. 161, 647699 (2020).
pdf
 On the Minimum Size of Hamilton Saturated Hypergraphs (with Andrzej ¯ak)
Electron. J. Combin. 27(4) (2020) \#P4.36.
pdf
2021
 High powers of Hamiltonian cycles in randomly augmented graphs (with S. Antoniuk, A. Dudek, Chr. Reiher, and M. Schacht)
J. Graph Th. 98(2) (2021) 255284.
pdf
 Tur\'an and Ramsey numbers for $3$uniform minimal paths of length $4$ (with J. Han and J. Polcyn)
J. Graph Th. 98 (2021) 460498.
pdf
 On weak twins and upanddown subpermutations (with A. Dudek and J. Grytczuk)
Integers 21A (2021) \#A10.
pdf
 Variations on twins in permutations (with A. Dudek and J. Grytczuk), Electron. J. Combin. (2021) \#P3.19.
pdf
 Tight Multiple Twins in Permutations (with A. Dudek and J. Grytczuk) Annals of Combinatorics
pdf https://doi.org/10.1007/s0002602100559y
2022
 Covering the edges of a random hypergraph by cliques (with V. Rödl) Discuss. Math. Graph Theory
pdf 42 (2022) 1333
1349.
 (same as 134) On weak twins and upanddown subpermutations (with A. Dudek and J.
Grytczuk), In: Number Theory and Combinatorics. A Collection in Honor of the Mathematics
of Ronald Graham / Landman Bruce M. [i in.] (red.), De Gruyter Proceedings in Mathematics,
2022, Berlin, Boston, De Gruyter, s.187202, ISBN 9783110754216.
DOI:10.1515/9783110754216010
 Patterns in ordered (random) matchings (with A. Dudek and J. Grytczuk), A. Castaneda and
F. RodrdriguezHenrriquez (Eds.): LATIN 2022, LNCS 13568, pp. 544556, 2022.
https://doi.org/10.1007/9783031206245..33
2023
 Properly colored Hamilton cycles in Diractype hypergraphs (with S. Antoniuk and N. Kam
cev), Electron. J. Combin.
 Constructing sparsest .hamiltonian saturated kuniform hypergraphs for a wide range of .
(with A. ¯ak), Europ. J. Combin.
 Sandwiching Biregular Random Graphs (with T. Klimosova, Chr. Reiher, and M. Sileikis)
Combin. Probab. Comput. , (2022).
doi:10.1017/S0963548322000049
 Long twins in random words (with A. Dudek and J. Grytczuk), Annals of Combin.
 Powers of Hamiltonian cycles in randomly augmented Dirac graphs  the complete collection
(with S. Antoniuk and A. Dudek), J. Graph Th.
Books
 Random Graphs'83, NorthHolland, 1985,
Annals of Discrete
Mathematics 28, 363+viii pages (M. Karoñski and A. Ruciñski, eds.)
 Random Graphs, Wiley, 1990, 368+viii
pages (M. Karo\'nski,
J. Jaworski and A. Ruciñski, eds.)
 On Nondeterministic Methods In Discrete
Mathematics (with
Z. Palka), Wydawnictwo NaukowoTechniczne, Warszawa 1996, 120 pages (in
Polish).
 Enumerative Combinatorics (with Z.
Palka),
Wydawnictwo NaukowoTechniczne, Warszawa 1998, 200 pages (in
Polish).
 Random Graphs (with S. Janson and T. \L
uczak), monograph, Wiley,
2000, xii+333 pages.

