Andrzej Rucinski

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 22

Top Topics

Top Venues

Electron. J. Comb.

J. Graph Theory

Discuss. Math. Graph Theory

Comb. Probab. Comput.

Publications

Andrzej Dudek, Jaroslaw Grytczuk, Andrzej Rucinski
Ordered Unavoidable Sub-Structures in Matchings and Random Matchings. Electron. J. Comb. 31 (2) (2024)
Tereza Klimosová, Christian Reiher, Andrzej Rucinski, Matas Sileikis
Sandwiching biregular random graphs. Comb. Probab. Comput. 32 (1) (2023)
Sylwia Antoniuk, Andrzej Dudek, Andrzej Rucinski
Powers of Hamiltonian cycles in randomly augmented Dirac graphs - The complete collection. J. Graph Theory 104 (4) (2023)
Sylwia Antoniuk, Nina Kamcev, Andrzej Rucinski
Properly Colored Hamilton Cycles in Dirac-Type Hypergraphs. Electron. J. Comb. 30 (1) (2023)
Andrzej Rucinski, Andrzej Zak
Constructing sparsest ℓ-hamiltonian saturated k-uniform hypergraphs for a wide range of ℓ. Eur. J. Comb. 109 (2023)
Andrzej Dudek, Jaroslaw Grytczuk, Andrzej Rucinski
Patterns in Ordered (random) Matchings. LATIN (2022)
Vojtech Rödl, Andrzej Rucinski
Covering the edges of a random hypergraph by cliques. Discuss. Math. Graph Theory 42 (4) (2022)
Jie Han, Joanna Polcyn, Andrzej Rucinski
Turán and Ramsey numbers for 3-uniform minimal paths of length 4. J. Graph Theory 98 (3) (2021)
Andrzej Dudek, Jaroslaw Grytczuk, Andrzej Rucinski
Variations on Twins in Permutations. Electron. J. Comb. 28 (3) (2021)
Sylwia Antoniuk, Andrzej Dudek, Christian Reiher, Andrzej Rucinski, Mathias Schacht
High powers of Hamiltonian cycles in randomly augmented graphs. J. Graph Theory 98 (2) (2021)
Andrzej Dudek, Christian Reiher, Andrzej Rucinski, Mathias Schacht
Powers of Hamiltonian cycles in randomly augmented graphs. Random Struct. Algorithms 56 (1) (2020)
Andrzej Rucinski, Andrzej Zak
On the Minimum Size of Hamilton Saturated Hypergraphs. Electron. J. Comb. 27 (4) (2020)
Andrzej Dudek, Andrzej Rucinski
Monochromatic loose paths in multicolored k-uniform cliques. Discret. Math. Theor. Comput. Sci. 21 (4) (2019)
Tomasz Luczak, Joanna Polcyn, Andrzej Rucinski
On multicolor Ramsey numbers for loose k-paths of length three. Eur. J. Comb. 71 (2018)
Andrzej Dudek, Andrzej Rucinski
Constructive Ramsey Numbers for Loose Hyperpaths. LATIN (2018)
Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski, Matas Sileikis
Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity. J. Comb. Theory, Ser. B 122 (2017)
Andrzej Rucinski, Eliza Jackowska, Joanna Polcyn
Multicolor Ramsey Numbers and Restricted Turán Numbers for the Loose 3-Uniform Path of Length Three. Electron. J. Comb. 24 (3) (2017)
Vojtech Rödl, Andrzej Rucinski, Mathias Schacht
An exponential-type upper bound for Folkman numbers. Comb. 37 (4) (2017)
Vojtech Rödl, Andrzej Rucinski, Mathias Schacht
Ramsey properties of random graphs and Folkman numbers. Discuss. Math. Graph Theory 37 (3) (2017)
Joanna Polcyn, Andrzej Rucinski
Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three. Discret. Math. 340 (2) (2017)
Andrzej Rucinski, Andrzej Zak
Upper Bounds on the Minimum Size of Hamilton Saturated Hypergraphs. Electron. J. Comb. 23 (4) (2016)
Eliza Jackowska, Joanna Polcyn, Andrzej Rucinski
Turán Numbers for 3-Uniform Linear Paths of Length 3. Electron. J. Comb. 23 (2) (2016)
Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski, Matas Sileikis
Loose Hamilton Cycles in Regular Hypergraphs. Comb. Probab. Comput. 24 (1) (2015)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
An improved upper bound on the density of universal random graphs. Random Struct. Algorithms 46 (2) (2015)
Andrzej Dudek, Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Approximate Counting of Matchings in (3, 3)-Hypergraphs. CoRR (2014)
Andrzej Dudek, Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Approximate Counting of Matchings in (3, 3)-Hypergraphs. SWAT (2014)
Vojtech Rödl, Andrzej Rucinski
Families of triples with high minimum degree are Hamiltonian. Discuss. Math. Graph Theory 34 (2) (2014)
Andrzej Dudek, Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Approximate Counting of Matchings in (3,3)-Hypergraphs. Electron. Colloquium Comput. Complex. 21 (2014)
Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski, Matas Sileikis
Approximate counting of regular hypergraphs. Inf. Process. Lett. 113 (19-21) (2013)
Edyta Szymanska, Marek Karpinski, Andrzej Rucinski
Approximate Counting of Matchings in Sparse Uniform Hypergraphs. ANALCO (2013)
Andrzej Rucinski, Andrzej Zak
Hamilton Saturated Hypergraphs of Essentially Minimum Size. Electron. J. Comb. 20 (2) (2013)
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Approximate Counting of Matchings in Sparse Hypergraphs CoRR (2012)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
Universality of Random Graphs. SIAM J. Discret. Math. 26 (1) (2012)
Noga Alon, Peter Frankl, Hao Huang, Vojtech Rödl, Andrzej Rucinski, Benny Sudakov
Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels. J. Comb. Theory, Ser. A 119 (6) (2012)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
An Improved Upper Bound on the Density of Universal Random Graphs. LATIN (2012)
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Approximate Counting of Matchings in Sparse Uniform Hypergraphs CoRR (2012)
Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski
Rainbow Hamilton Cycles in Uniform Hypergraphs. Electron. J. Comb. 19 (1) (2012)
Peter Frankl, Vojtech Rödl, Andrzej Rucinski
On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size. Comb. Probab. Comput. 21 (1-2) (2012)
Klas Markström, Andrzej Rucinski
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees. Eur. J. Comb. 32 (5) (2011)
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs. LATIN (2010)
Andrzej Dudek, Joanna Polcyn, Andrzej Rucinski
-independence. J. Comb. Optim. 19 (2) (2010)
Catherine S. Greenhill, Svante Janson, Andrzej Rucinski
On the Number of Perfect Matchings in Random Lifts. Comb. Probab. Comput. 19 (5-6) (2010)
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Computational Complexity of the Perfect Matching Problem in Hypergraphs with Subcritical Density. Int. J. Found. Comput. Sci. 21 (6) (2010)
Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Jozef Skokan
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. Comb. Probab. Comput. 18 (1-2) (2009)
Joanna Polcyn, Andrzej Rucinski
Short paths in epsilon-regular pairs and small diameter decompositions of dense graphs. Discret. Math. 309 (22) (2009)
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
The Complexity of Perfect Matching Problems on Dense Hypergraphs. ISAAC (2009)
Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
Perfect matchings in large uniform hypergraphs with large minimum collective degree. J. Comb. Theory, Ser. A 116 (3) (2009)
Izolda Gorgol, Andrzej Rucinski
Planar Ramsey numbers for cycles. Discret. Math. 308 (19) (2008)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
Universality of random graphs. SODA (2008)
Vojtech Rödl, Endre Szemerédi, Andrzej Rucinski
-uniform hypergraphs. Comb. 28 (2) (2008)
Vojtech Rödl, Andrzej Rucinski, Mathias Schacht
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs. SIAM J. Discret. Math. 21 (2) (2007)
Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
Perfect matchings in uniform hypergraphs with large minimum degree. Eur. J. Comb. 27 (8) (2006)
Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan
The Ramsey number for hypergraph cycles I. J. Comb. Theory, Ser. A 113 (1) (2006)
Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
Short paths in quasi-random triple systems with sparse underlying graphs. J. Comb. Theory, Ser. B 96 (4) (2006)
Catherine S. Greenhill, Andrzej Rucinski
Neighbour-Distinguishing Edge Colourings of Random Regular Graphs. Electron. J. Comb. 13 (1) (2006)
Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
A Dirac-Type Theorem for 3-Uniform Hypergraphs. Comb. Probab. Comput. 15 (1-2) (2006)
Endre Szemerédi, Andrzej Rucinski, Vojtech Rödl
The Generalization of Dirac's Theorem for Hypergraphs. MFCS (2005)
Andrzej Kurek, Andrzej Rucinski
Two variants of the size Ramsey number. Discuss. Math. Graph Theory 25 (1-2) (2005)
Svante Janson, Andrzej Rucinski
The Deletion Method For Upper Tail Estimates. Comb. 24 (4) (2004)
Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald
Random Hypergraph Processes with Degree Restrictions. Graphs Comb. 20 (3) (2004)
Ehud Friedgut, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali
Ramsey Games Against a One-Armed Bandit. Comb. Probab. Comput. 12 (5-6) (2003)
Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald
Connectedness Of The Degree Bounded Star Process. Comb. Probab. Comput. 12 (3) (2003)
Ronald L. Graham, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski
Ramsey Properties of Families of Graphs. J. Comb. Theory, Ser. B 86 (2) (2002)
Yuejian Peng, Vojtech Rödl, Andrzej Rucinski
Holes in Graphs. Electron. J. Comb. 9 (1) (2002)
Svante Janson, Andrzej Rucinski
The infamous upper tail. Random Struct. Algorithms 20 (3) (2002)
Tomasz Luczak, Andrzej Rucinski, Sebastian Urbanski
Vertex Ramsey Properties of Families of Graphs. J. Comb. Theory, Ser. B 84 (2) (2002)
Tomasz Luczak, Andrzej Rucinski, Sebastian Urbanski
On minimal Folkman graphs. Discret. Math. 236 (1-3) (2001)
Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski
On Bipartite Graphs with Linear Ramsey Numbers. Comb. 21 (2) (2001)
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
Near-optimum Universal Graphs for Graphs with Bounded Degrees. RANDOM-APPROX (2001)
Vojtech Rödl, Andrzej Rucinski, Michelle Wagner
Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma. SIAM J. Comput. 31 (2) (2001)
Justyna Kurkowiak, Andrzej Rucinski
Solitary subgraphs of random graphs. Discret. Math. 213 (1-3) (2000)
Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski
On graphs with linear Ramsey numbers. J. Graph Theory 35 (3) (2000)
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
Universality and Tolerance. FOCS (2000)
Vojtech Rödl, Andrzej Rucinski
Perfect Matchings in -Regular Graphs and the Blow-Up Lemma. Comb. 19 (3) (1999)
Vojtech Rödl, Andrzej Rucinski, Anusch Taraz
Hypergraph Packing And Graph Embedding. Comb. Probab. Comput. 8 (4) (1999)
Noga Alon, Vojtech Rödl, Andrzej Rucinski
Perfect Matchings in ε-regular Graphs. Electron. J. Comb. 5 (1998)
Dwight Duffus, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski
Endomorphisms of Partially Ordered Sets. Comb. Probab. Comput. 7 (1) (1998)
Vojtech Rödl, Andrzej Rucinski, Michelle Wagner
An Algorithmic Embedding of Graphs via Perfect Matchings. RANDOM (1998)
Vojtech Rödl, Andrzej Rucinski
Ramsey Properties of Random Hypergraphs. J. Comb. Theory, Ser. A 81 (1) (1998)
Andrzej Rucinski, Miroslaw Truszczynski
A note on local colorings of graphs. Discret. Math. 164 (1-3) (1997)
Vojtech Rödl, Andrzej Rucinski
Bipartite Coverings of Graphs. Comb. Probab. Comput. 6 (3) (1997)
Tomasz Luczak, Andrzej Rucinski, Jacek Gruszka
On the evolution of a random tournament. Discret. Math. 148 (1-3) (1996)
Vojtech Rödl, Andrzej Rucinski
Random Graphs with Monochromatic Triangles in Every Edge Coloring. Random Struct. Algorithms 5 (2) (1994)
Andrzej Rucinski, Andrew Vince
The solution to an extremal problem on balanced extensions of graphs. J. Graph Theory 17 (3) (1993)
Andrzej Rucinski
Matching and covering the vertices of a random graph by copies of a given graph. Discret. Math. 105 (1-3) (1992)
Tomasz Luczak, Andrzej Rucinski, Bernd Voigt
Ramsey properties of random graphs. J. Comb. Theory, Ser. B 56 (1) (1992)
Andrzej Rucinski, Nicholas C. Wormald
Random Graph Processes with Degree Restrictions. Comb. Probab. Comput. 1 (1992)
Tomasz Luczak, Andrzej Rucinski
Tree-Matchings in Graph Processes. SIAM J. Discret. Math. 4 (1) (1991)
Andrew D. Barbour, Svante Janson, Michal Karonski, Andrzej Rucinski
Small Cliques in Random Graphs. Random Struct. Algorithms 1 (4) (1990)
Andrzej Rucinski
Random graphs. ZOR Methods Model. Oper. Res. 33 (2) (1989)
Andrew D. Barbour, Michal Karonski, Andrzej Rucinski
A central limit theorem for decomposable random variables with applications to random graphs. J. Comb. Theory, Ser. B 47 (2) (1989)
Andrzej Rucinski, Andrew Vince
Balanced extensions of graphs and hypergraphs. Comb. 8 (3) (1988)
Zbigniew Palka, Andrzej Rucinski
On the order of the largest induced tree in a random graph. Discret. Appl. Math. 15 (1) (1986)
Andrzej Rucinski, Andrew Vince
Strongly balanced graphs and random graphs. J. Graph Theory 10 (2) (1986)
Zbigniew Palka, Andrzej Rucinski, Joel Spencer
On a method for random graphs. Discret. Math. 61 (2-3) (1986)
Andrzej Rucinski
! is asymptotically normal. Discret. Math. 49 (3) (1984)