Andrzej Rucinski

According to our database1, Andrzej Rucinski authored at least 79 papers between 1984 and 2018.

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



In proceedings 
PhD thesis 





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, Ser. B, 2017

Ramsey properties of random graphs and Folkman numbers.
Discussiones Mathematicae Graph Theory, 2017

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

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

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

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

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

Loose Hamilton Cycles in Regular Hypergraphs.
Combinatorics, Probability & Computing, 2015

Approximate Counting of Matchings in (3,3)-Hypergraphs.
Electronic Colloquium on Computational Complexity (ECCC), 2014

Families of triples with high minimum degree are Hamiltonian.
Discussiones Mathematicae 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.
Electr. 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

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

On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size.
Combinatorics, Probability & Computing, 2012

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

An Improved Upper Bound on the Density of Universal Random Graphs.
Proceedings of the LATIN 2012: Theoretical Informatics, 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 q-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.
Combinatorics, Probability & Computing, 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, Ser. A, 2009

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

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.
Combinatorics, Probability & Computing, 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.
Discrete Mathematics, 2008

An approximate Dirac-type theorem for k -uniform hypergraphs.
Combinatorica, 2008

Universality of random graphs.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

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

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

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

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

A Dirac-Type Theorem for 3-Uniform Hypergraphs.
Combinatorics, Probability & Computing, 2006

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

Two variants of the size Ramsey number.
Discussiones Mathematicae 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 and Combinatorics, 2004

The Deletion Method For Upper Tail Estimates.
Combinatorica, 2004

Connectedness Of The Degree Bounded Star Process.
Combinatorics, Probability & Computing, 2003

Ramsey Games Against a One-Armed Bandit.
Combinatorics, Probability & Computing, 2003

The infamous upper tail.
Random Struct. Algorithms, 2002

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

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

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

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

On minimal Folkman graphs.
Discrete Mathematics, 2001

On Bipartite Graphs with Linear Ramsey Numbers.
Combinatorica, 2001

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

On graphs with linear Ramsey numbers.
Journal of Graph Theory, 2000

Solitary subgraphs of random graphs.
Discrete Mathematics, 2000

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

Hypergraph Packing And Graph Embedding.
Combinatorics, Probability & Computing, 1999

Perfect Matchings in -Regular Graphs and the Blow-Up Lemma.
Combinatorica, 1999

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

Endomorphisms of Partially Ordered Sets.
Combinatorics, Probability & Computing, 1998

Perfect Matchings in ε-regular Graphs.
Electr. 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.
Discrete Mathematics, 1997

Bipartite Coverings of Graphs.
Combinatorics, Probability & Computing, 1997

On the evolution of a random tournament.
Discrete Mathematics, 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.
Journal of Graph Theory, 1993

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

Matching and covering the vertices of a random graph by copies of a given graph.
Discrete Mathematics, 1992

Random Graph Processes with Degree Restrictions.
Combinatorics, Probability & Computing, 1992

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

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

Random graphs.
ZOR - Meth. & Mod. of OR, 1989

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

Balanced extensions of graphs and hypergraphs.
Combinatorica, 1988

Strongly balanced graphs and random graphs.
Journal of Graph Theory, 1986

On a method for random graphs.
Discrete Mathematics, 1986

On the order of the largest induced tree in a random graph.
Discrete Applied Mathematics, 1986

The behaviour of (k, ..., kn, n-ik)ci/i! is asymptotically normal.
Discrete Mathematics, 1984