Andrzej Rucinski

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