Andrzej Rucinski

Orcid: 0000-0002-0742-7694

  • Adam Mickiewicz University, Poznan, Poland
  • University of Florida, Department of Statistics, Gainesville, USA (former)

According to our database1, Andrzej Rucinski authored at least 95 papers between 1984 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



Ordered Unavoidable Sub-Structures in Matchings and Random Matchings.
Electron. J. Comb., 2024

Powers of Hamiltonian cycles in randomly augmented Dirac graphs - The complete collection.
J. Graph Theory, December, 2023

Sandwiching biregular random graphs.
Comb. Probab. Comput., January, 2023

Constructing sparsest ℓ-hamiltonian saturated k-uniform hypergraphs for a wide range of ℓ.
Eur. J. Comb., 2023

Properly Colored Hamilton Cycles in Dirac-Type Hypergraphs.
Electron. J. Comb., 2023

Covering the edges of a random hypergraph by cliques.
Discuss. Math. Graph Theory, 2022

Patterns in Ordered (random) Matchings.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Turán and Ramsey numbers for 3-uniform minimal paths of length 4.
J. Graph Theory, 2021

High powers of Hamiltonian cycles in randomly augmented graphs.
J. Graph Theory, 2021

Variations on Twins in Permutations.
Electron. J. Comb., 2021

Powers of Hamiltonian cycles in randomly augmented graphs.
Random Struct. Algorithms, 2020

On the Minimum Size of Hamilton Saturated Hypergraphs.
Electron. J. Comb., 2020

Monochromatic loose paths in multicolored k-uniform cliques.
Discret. Math. Theor. Comput. Sci., 2019

On multicolor Ramsey numbers for loose k-paths of length three.
Eur. J. Comb., 2018

Constructive Ramsey Numbers for Loose Hyperpaths.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity.
J. Comb. Theory B, 2017

Ramsey properties of random graphs and Folkman numbers.
Discuss. Math. Graph Theory, 2017

Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three.
Discret. Math., 2017

Multicolor Ramsey Numbers and Restricted Turán Numbers for the Loose 3-Uniform Path of Length Three.
Electron. J. Comb., 2017

An exponential-type upper bound for Folkman numbers.
Comb., 2017

Upper Bounds on the Minimum Size of Hamilton Saturated Hypergraphs.
Electron. J. Comb., 2016

Turán Numbers for 3-Uniform Linear Paths of Length 3.
Electron. J. Comb., 2016

An improved upper bound on the density of universal random graphs.
Random Struct. Algorithms, 2015

Loose Hamilton Cycles in Regular Hypergraphs.
Comb. Probab. Comput., 2015

Approximate Counting of Matchings in (3,3)-Hypergraphs.
Electron. Colloquium Comput. Complex., 2014

Families of triples with high minimum degree are Hamiltonian.
Discuss. Math. Graph Theory, 2014

Approximate Counting of Matchings in (3, 3)-Hypergraphs.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

Approximate counting of regular hypergraphs.
Inf. Process. Lett., 2013

Hamilton Saturated Hypergraphs of Essentially Minimum Size.
Electron. J. Comb., 2013

Approximate Counting of Matchings in Sparse Uniform Hypergraphs.
Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, 2013

The Origins of the Theory of Random Graphs.
Proceedings of the Mathematics of Paul Erdős I, 2013

Universality of Random Graphs.
SIAM J. Discret. Math., 2012

Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels.
J. Comb. Theory A, 2012

On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size.
Comb. Probab. Comput., 2012

Approximate Counting of Matchings in Sparse Hypergraphs
CoRR, 2012

Rainbow Hamilton Cycles in Uniform Hypergraphs.
Electron. J. Comb., 2012

Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees.
Eur. J. Comb., 2011

Subhypergraph counts in extremal and random hypergraphs and the fractional <i>q</i>-independence.
J. Comb. Optim., 2010

Computational Complexity of the Perfect Matching Problem in Hypergraphs with Subcritical Density.
Int. J. Found. Comput. Sci., 2010

On the Number of Perfect Matchings in Random Lifts.
Comb. Probab. Comput., 2010

Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Perfect matchings in large uniform hypergraphs with large minimum collective degree.
J. Comb. Theory A, 2009

Short paths in epsilon-regular pairs and small diameter decompositions of dense graphs.
Discret. Math., 2009

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.
Comb. Probab. Comput., 2009

The Complexity of Perfect Matching Problems on Dense Hypergraphs.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Planar Ramsey numbers for cycles.
Discret. Math., 2008

An approximate Dirac-type theorem for <i>k</i> -uniform hypergraphs.
Comb., 2008

Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs.
SIAM J. Discret. Math., 2007

Short paths in quasi-random triple systems with sparse underlying graphs.
J. Comb. Theory B, 2006

The Ramsey number for hypergraph cycles I.
J. Comb. Theory A, 2006

Perfect matchings in uniform hypergraphs with large minimum degree.
Eur. J. Comb., 2006

A Dirac-Type Theorem for 3-Uniform Hypergraphs.
Comb. Probab. Comput., 2006

Neighbour-Distinguishing Edge Colourings of Random Regular Graphs.
Electron. J. Comb., 2006

A sharp threshold for random graphs with a monochromatic triangle in every edge coloring.
Memoirs of the American Mathematical Society 845, American Mathematical Society, ISBN: 978-0-8218-3825-9, 2006

Two variants of the size Ramsey number.
Discuss. Math. Graph Theory, 2005

The Generalization of Dirac's Theorem for Hypergraphs.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Random Hypergraph Processes with Degree Restrictions.
Graphs Comb., 2004

The Deletion Method For Upper Tail Estimates.
Comb., 2004

Connectedness Of The Degree Bounded Star Process.
Comb. Probab. Comput., 2003

Ramsey Games Against a One-Armed Bandit.
Comb. Probab. Comput., 2003

The infamous upper tail.
Random Struct. Algorithms, 2002

Vertex Ramsey Properties of Families of Graphs.
J. Comb. Theory B, 2002

Ramsey Properties of Families of Graphs.
J. Comb. Theory B, 2002

Holes in Graphs.
Electron. J. Comb., 2002

Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma.
SIAM J. Comput., 2001

On minimal Folkman graphs.
Discret. Math., 2001

On Bipartite Graphs with Linear Ramsey Numbers.
Comb., 2001

Near-optimum Universal Graphs for Graphs with Bounded Degrees.
Proceedings of the Approximation, 2001

On graphs with linear Ramsey numbers.
J. Graph Theory, 2000

Solitary subgraphs of random graphs.
Discret. Math., 2000

Universality and Tolerance.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Random graphs.
Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-471-17541-4, 2000

Hypergraph Packing And Graph Embedding.
Comb. Probab. Comput., 1999

Perfect Matchings in <epsilon>-Regular Graphs and the Blow-Up Lemma.
Comb., 1999

Ramsey Properties of Random Hypergraphs.
J. Comb. Theory A, 1998

Endomorphisms of Partially Ordered Sets.
Comb. Probab. Comput., 1998

Perfect Matchings in ε-regular Graphs.
Electron. J. Comb., 1998

An Algorithmic Embedding of Graphs via Perfect Matchings.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

A note on local colorings of graphs.
Discret. Math., 1997

Bipartite Coverings of Graphs.
Comb. Probab. Comput., 1997

On the evolution of a random tournament.
Discret. Math., 1996

Random Graphs with Monochromatic Triangles in Every Edge Coloring.
Random Struct. Algorithms, 1994

The solution to an extremal problem on balanced extensions of graphs.
J. Graph Theory, 1993

Ramsey properties of random graphs.
J. Comb. Theory B, 1992

Matching and covering the vertices of a random graph by copies of a given graph.
Discret. Math., 1992

Random Graph Processes with Degree Restrictions.
Comb. Probab. Comput., 1992

Tree-Matchings in Graph Processes.
SIAM J. Discret. Math., 1991

Small Cliques in Random Graphs.
Random Struct. Algorithms, 1990

Random graphs.
ZOR Methods Model. Oper. Res., 1989

A central limit theorem for decomposable random variables with applications to random graphs.
J. Comb. Theory B, 1989

Balanced extensions of graphs and hypergraphs.
Comb., 1988

Strongly balanced graphs and random graphs.
J. Graph Theory, 1986

On a method for random graphs.
Discret. Math., 1986

On the order of the largest induced tree in a random graph.
Discret. Appl. Math., 1986

The behaviour of (k, ..., k<sup>n</sup>, n-ik)c<sup>i/i</sup>! is asymptotically normal.
Discret. Math., 1984