The behaviour of (k, ..., kn, n-ik)ci/i! is asymptotically normal. - Andrzej Rucinski 001 (Discret. Math., 1984)

On the order of the largest induced tree in a random graph. - Zbigniew Palka; Andrzej Rucinski 001 (Discret. Appl. Math., 1986)

On a method for random graphs. - Zbigniew Palka; Andrzej Rucinski 001; Joel Spencer (Discret. Math., 1986)

Strongly balanced graphs and random graphs. - Andrzej Rucinski 001; Andrew Vince (J. Graph Theory, 1986)

Balanced extensions of graphs and hypergraphs. - Andrzej Rucinski 001; Andrew Vince (Comb., 1988)

A central limit theorem for decomposable random variables with applications to random graphs. - Andrew D. Barbour; Michal Karonski; Andrzej Rucinski 001 (J. Comb. Theory B, 1989)

Random graphs. - Andrzej Rucinski 001 (ZOR Methods Model. Oper. Res., 1989)

Small Cliques in Random Graphs. - Andrew D. Barbour; Svante Janson; Michal Karonski; Andrzej Rucinski 001 (Random Struct. Algorithms, 1990)

Tree-Matchings in Graph Processes. - Tomasz Luczak 001; Andrzej Rucinski 001 (SIAM J. Discret. Math., 1991)

Random Graph Processes with Degree Restrictions. - Andrzej Rucinski 001; Nicholas C. Wormald (Comb. Probab. Comput., 1992)

Matching and covering the vertices of a random graph by copies of a given graph. - Andrzej Rucinski 001 (Discret. Math., 1992)

Ramsey properties of random graphs. - Tomasz Luczak 001; Andrzej Rucinski 001; Bernd Voigt (J. Comb. Theory B, 1992)

The solution to an extremal problem on balanced extensions of graphs. - Andrzej Rucinski 001; Andrew Vince (J. Graph Theory, 1993)

Random Graphs with Monochromatic Triangles in Every Edge Coloring. - Vojtech Rödl; Andrzej Rucinski 001 (Random Struct. Algorithms, 1994)

On the evolution of a random tournament. - Tomasz Luczak 001; Andrzej Rucinski 001; Jacek Gruszka (Discret. Math., 1996)

Bipartite Coverings of Graphs. - Vojtech Rödl; Andrzej Rucinski 001 (Comb. Probab. Comput., 1997)

A note on local colorings of graphs. - Andrzej Rucinski 001; Miroslaw Truszczynski (Discret. Math., 1997)

An Algorithmic Embedding of Graphs via Perfect Matchings. - Vojtech Rödl; Andrzej Rucinski 001; Michelle Wagner (RANDOM, 1998)

Perfect Matchings in ε-regular Graphs. - Noga Alon; Vojtech Rödl; Andrzej Rucinski 001 (Electron. J. Comb., 1998)

Endomorphisms of Partially Ordered Sets. - Dwight Duffus; Tomasz Luczak 001; Vojtech Rödl; Andrzej Rucinski 001 (Comb. Probab. Comput., 1998)

Ramsey Properties of Random Hypergraphs. - Vojtech Rödl; Andrzej Rucinski 001 (J. Comb. Theory A, 1998)

Perfect Matchings in <epsilon>-Regular Graphs and the Blow-Up Lemma. - Vojtech Rödl; Andrzej Rucinski 001 (Comb., 1999)

Hypergraph Packing And Graph Embedding. - Vojtech Rödl; Andrzej Rucinski 001; Anusch Taraz (Comb. Probab. Comput., 1999)

Random graphs. - Svante Janson; Tomasz Luczak 001; Andrzej Rucinski 001 (Wiley, 2000)

Universality and Tolerance. - Noga Alon; Michael R. Capalbo; Yoshiharu Kohayakawa; Vojtech Rödl; Andrzej Rucinski 001; Endre Szemerédi (FOCS, 2000)

Solitary subgraphs of random graphs. - Justyna Kurkowiak; Andrzej Rucinski 001 (Discret. Math., 2000)

On graphs with linear Ramsey numbers. - Ronald L. Graham; Vojtech Rödl; Andrzej Rucinski 001 (J. Graph Theory, 2000)

Near-optimum Universal Graphs for Graphs with Bounded Degrees. - Noga Alon; Michael R. Capalbo; Yoshiharu Kohayakawa; Vojtech Rödl; Andrzej Rucinski 001; Endre Szemerédi (RANDOM-APPROX, 2001)

On Bipartite Graphs with Linear Ramsey Numbers. - Ronald L. Graham; Vojtech Rödl; Andrzej Rucinski 001 (Comb., 2001)

On minimal Folkman graphs. - Tomasz Luczak 001; Andrzej Rucinski 001; Sebastian Urbanski (Discret. Math., 2001)

Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma. - Vojtech Rödl; Andrzej Rucinski 001; Michelle Wagner (SIAM J. Comput., 2001)

Holes in Graphs. - Yuejian Peng; Vojtech Rödl; Andrzej Rucinski 001 (Electron. J. Comb., 2002)

Ramsey Properties of Families of Graphs. - Ronald L. Graham; Tomasz Luczak 001; Vojtech Rödl; Andrzej Rucinski 001 (J. Comb. Theory B, 2002)

Vertex Ramsey Properties of Families of Graphs. - Tomasz Luczak 001; Andrzej Rucinski 001; Sebastian Urbanski (J. Comb. Theory B, 2002)

The infamous upper tail. - Svante Janson; Andrzej Rucinski 001 (Random Struct. Algorithms, 2002)

Ramsey Games Against a One-Armed Bandit. - Ehud Friedgut; Yoshiharu Kohayakawa; Vojtech Rödl; Andrzej Rucinski 001; Prasad Tetali (Comb. Probab. Comput., 2003)

Connectedness Of The Degree Bounded Star Process. - Catherine S. Greenhill; Andrzej Rucinski 001; Nicholas C. Wormald (Comb. Probab. Comput., 2003)

The Deletion Method For Upper Tail Estimates. - Svante Janson; Andrzej Rucinski 001 (Comb., 2004)

Random Hypergraph Processes with Degree Restrictions. - Catherine S. Greenhill; Andrzej Rucinski 001; Nicholas C. Wormald (Graphs Comb., 2004)

The Generalization of Dirac's Theorem for Hypergraphs. - Endre Szemerédi; Andrzej Rucinski 001; Vojtech Rödl (MFCS, 2005)

Two variants of the size Ramsey number. - Andrzej Kurek; Andrzej Rucinski 001 (Discuss. Math. Graph Theory, 2005)

A sharp threshold for random graphs with a monochromatic triangle in every edge coloring. - Ehud Friedgut; Vojtech Rödl; Andrzej Rucinski 001; Prasad Tetali (American Mathematical Society, 2006)

Neighbour-Distinguishing Edge Colourings of Random Regular Graphs. - Catherine S. Greenhill; Andrzej Rucinski 001 (Electron. J. Comb., 2006)

A Dirac-Type Theorem for 3-Uniform Hypergraphs. - Vojtech Rödl; Andrzej Rucinski 001; Endre Szemerédi (Comb. Probab. Comput., 2006)

Perfect matchings in uniform hypergraphs with large minimum degree. - Vojtech Rödl; Andrzej Rucinski 001; Endre Szemerédi (Eur. J. Comb., 2006)

The Ramsey number for hypergraph cycles I. - Penny E. Haxell; Tomasz Luczak 001; Yuejian Peng; Vojtech Rödl; Andrzej Rucinski 001; Miklós Simonovits; Jozef Skokan (J. Comb. Theory A, 2006)

Short paths in quasi-random triple systems with sparse underlying graphs. - Joanna Polcyn; Vojtech Rödl; Andrzej Rucinski 001; Endre Szemerédi (J. Comb. Theory B, 2006)

Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs. - Vojtech Rödl; Andrzej Rucinski 001; Mathias Schacht (SIAM J. Discret. Math., 2007)

An approximate Dirac-type theorem for k -uniform hypergraphs. - Vojtech Rödl; Endre Szemerédi; Andrzej Rucinski 001 (Comb., 2008)

Planar Ramsey numbers for cycles. - Izolda Gorgol; Andrzej Rucinski 001 (Discret. Math., 2008)

The Complexity of Perfect Matching Problems on Dense Hypergraphs. - Marek Karpinski; Andrzej Rucinski 001; Edyta Szymanska (ISAAC, 2009)

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. - Penny E. Haxell; Tomasz Luczak 001; Yuejian Peng; Vojtech Rödl; Andrzej Rucinski 001; Jozef Skokan (Comb. Probab. Comput., 2009)

Short paths in epsilon-regular pairs and small diameter decompositions of dense graphs. - Joanna Polcyn; Andrzej Rucinski 001 (Discret. Math., 2009)

Perfect matchings in large uniform hypergraphs with large minimum collective degree. - Vojtech Rödl; Andrzej Rucinski 001; Endre Szemerédi (J. Comb. Theory A, 2009)

Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs. - Marek Karpinski; Andrzej Rucinski 001; Edyta Szymanska (LATIN, 2010)

On the Number of Perfect Matchings in Random Lifts. - Catherine S. Greenhill; Svante Janson; Andrzej Rucinski 001 (Comb. Probab. Comput., 2010)

Computational Complexity of the Perfect Matching Problem in Hypergraphs with Subcritical Density. - Marek Karpinski; Andrzej Rucinski 001; Edyta Szymanska (Int. J. Found. Comput. Sci., 2010)

Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence. - Andrzej Dudek; Joanna Polcyn; Andrzej Rucinski 001 (J. Comb. Optim., 2010)

Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees. - Klas Markström; Andrzej Rucinski 001 (Eur. J. Comb., 2011)

Rainbow Hamilton Cycles in Uniform Hypergraphs. - Andrzej Dudek; Alan M. Frieze; Andrzej Rucinski 001 (Electron. J. Comb., 2012)

Approximate Counting of Matchings in Sparse Hypergraphs - Marek Karpinski; Andrzej Rucinski 001; Edyta Szymanska (CoRR, 2012)

On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size. - Peter Frankl; Vojtech Rödl; Andrzej Rucinski 001 (Comb. Probab. Comput., 2012)

Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels. - Noga Alon; Peter Frankl; Hao Huang 005; Vojtech Rödl; Andrzej Rucinski 001; Benny Sudakov (J. Comb. Theory A, 2012)

Universality of Random Graphs. - Domingos Dellamonica Jr.; Yoshiharu Kohayakawa; Vojtech Rödl; Andrzej Rucinski 001 (SIAM J. Discret. Math., 2012)

The Origins of the Theory of Random Graphs. - Michal Karonski; Andrzej Rucinski 001 (The Mathematics of Paul Erdős I, 2013)

Approximate Counting of Matchings in Sparse Uniform Hypergraphs. - Edyta Szymanska; Marek Karpinski; Andrzej Rucinski 001 (ANALCO, 2013)

Hamilton Saturated Hypergraphs of Essentially Minimum Size. - Andrzej Rucinski 001; Andrzej Zak (Electron. J. Comb., 2013)

Approximate counting of regular hypergraphs. - Andrzej Dudek; Alan M. Frieze; Andrzej Rucinski 001; Matas Sileikis (Inf. Process. Lett., 2013)

Approximate Counting of Matchings in (3, 3)-Hypergraphs. - Andrzej Dudek; Marek Karpinski; Andrzej Rucinski 001; Edyta Szymanska (SWAT, 2014)

Families of triples with high minimum degree are Hamiltonian. - Vojtech Rödl; Andrzej Rucinski 001 (Discuss. Math. Graph Theory, 2014)

Approximate Counting of Matchings in (3,3)-Hypergraphs. - Andrzej Dudek; Marek Karpinski; Andrzej Rucinski 001; Edyta Szymanska (Electron. Colloquium Comput. Complex., 2014)

Loose Hamilton Cycles in Regular Hypergraphs. - Andrzej Dudek; Alan M. Frieze; Andrzej Rucinski 001; Matas Sileikis (Comb. Probab. Comput., 2015)

An improved upper bound on the density of universal random graphs. - Domingos Dellamonica Jr.; Yoshiharu Kohayakawa; Vojtech Rödl; Andrzej Rucinski 001 (Random Struct. Algorithms, 2015)

Turán Numbers for 3-Uniform Linear Paths of Length 3. - Eliza Jackowska; Joanna Polcyn; Andrzej Rucinski 001 (Electron. J. Comb., 2016)

Upper Bounds on the Minimum Size of Hamilton Saturated Hypergraphs. - Andrzej Rucinski 001; Andrzej Zak (Electron. J. Comb., 2016)

An exponential-type upper bound for Folkman numbers. - Vojtech Rödl; Andrzej Rucinski 001; Mathias Schacht (Comb., 2017)

Multicolor Ramsey Numbers and Restricted Turán Numbers for the Loose 3-Uniform Path of Length Three. - Andrzej Rucinski 001; Eliza Jackowska; Joanna Polcyn (Electron. J. Comb., 2017)

Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three. - Joanna Polcyn; Andrzej Rucinski 001 (Discret. Math., 2017)

Ramsey properties of random graphs and Folkman numbers. - Vojtech Rödl; Andrzej Rucinski 001; Mathias Schacht (Discuss. Math. Graph Theory, 2017)

Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity. - Andrzej Dudek; Alan M. Frieze; Andrzej Rucinski 001; Matas Sileikis (J. Comb. Theory B, 2017)

Constructive Ramsey Numbers for Loose Hyperpaths. - Andrzej Dudek; Andrzej Rucinski 001 (LATIN, 2018)

On multicolor Ramsey numbers for loose k-paths of length three. - Tomasz Luczak 001; Joanna Polcyn; Andrzej Rucinski 001 (Eur. J. Comb., 2018)

Monochromatic loose paths in multicolored k-uniform cliques. - Andrzej Dudek; Andrzej Rucinski 001 (Discret. Math. Theor. Comput. Sci., 2019)

On the Minimum Size of Hamilton Saturated Hypergraphs. - Andrzej Rucinski 001; Andrzej Zak (Electron. J. Comb., 2020)

Powers of Hamiltonian cycles in randomly augmented graphs. - Andrzej Dudek; Christian Reiher; Andrzej Rucinski 001; Mathias Schacht (Random Struct. Algorithms, 2020)

Variations on Twins in Permutations. - Andrzej Dudek; Jaroslaw Grytczuk; Andrzej Rucinski 001 (Electron. J. Comb., 2021)

High powers of Hamiltonian cycles in randomly augmented graphs. - Sylwia Antoniuk; Andrzej Dudek; Christian Reiher; Andrzej Rucinski 001; Mathias Schacht (J. Graph Theory, 2021)

Turán and Ramsey numbers for 3-uniform minimal paths of length 4. - Jie Han; Joanna Polcyn; Andrzej Rucinski 001 (J. Graph Theory, 2021)

Patterns in Ordered (random) Matchings. - Andrzej Dudek; Jaroslaw Grytczuk; Andrzej Rucinski 001 (LATIN, 2022)

Covering the edges of a random hypergraph by cliques. - Vojtech Rödl; Andrzej Rucinski 001 (Discuss. Math. Graph Theory, 2022)

Properly Colored Hamilton Cycles in Dirac-Type Hypergraphs. - Sylwia Antoniuk; Nina Kamcev; Andrzej Rucinski 001 (Electron. J. Comb., 2023)

Constructing sparsest ℓ-hamiltonian saturated k-uniform hypergraphs for a wide range of ℓ. - Andrzej Rucinski 001; Andrzej Zak (Eur. J. Comb., 2023)

Sandwiching biregular random graphs. - Tereza Klimosová; Christian Reiher; Andrzej Rucinski 001; Matas Sileikis (Comb. Probab. Comput., 2023)

Powers of Hamiltonian cycles in randomly augmented Dirac graphs - The complete collection. - Sylwia Antoniuk; Andrzej Dudek; Andrzej Rucinski 001 (J. Graph Theory, 2023)

Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs. - Natalie C. Behague; Trent G. Marbach; Pawel Pralat; Andrzej Rucinski 001 (Electron. J. Comb., 2024)

Ordered Unavoidable Sub-Structures in Matchings and Random Matchings. - Andrzej Dudek; Jaroslaw Grytczuk; Andrzej Rucinski 001 (Electron. J. Comb., 2024)

Shuffle Squares and Nest-Free Graphs. - Jaroslaw Grytczuk; Bartlomiej Pawlik; Andrzej Rucinski 001 (WORDS, 2025)

Twins in ordered hyper-matchings. - Andrzej Dudek; Jaroslaw Grytczuk; Andrzej Rucinski 001 (Discuss. Math. Graph Theory, 2025)

Erdős-Szekeres type theorems for ordered uniform matchings. - Andrzej Dudek; Jaroslaw Grytczuk; Andrzej Rucinski 001 (J. Comb. Theory B, 2025)