Andrzej Rucinski

J. Comb. Theory B, 2025

Twins in ordered hyper-matchings.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2025

2024

Ordered Unavoidable Sub-Structures in Matchings and Random Matchings.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

2023

Powers of Hamiltonian cycles in randomly augmented Dirac graphs - The complete collection.

[BibT_eX]

[DOI]

Sylwia Antoniuk

J. Graph Theory, December, 2023

Sandwiching biregular random graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., January, 2023

Constructing sparsest ℓ-hamiltonian saturated k-uniform hypergraphs for a wide range of ℓ.

[BibT_eX]

[DOI]

Eur. J. Comb., 2023

Properly Colored Hamilton Cycles in Dirac-Type Hypergraphs.

[BibT_eX]

[DOI]

Sylwia Antoniuk

Nina Kamcev

Electron. J. Comb., 2023

2022

Covering the edges of a random hypergraph by cliques.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2022

Patterns in Ordered (random) Matchings.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

Turán and Ramsey numbers for 3-uniform minimal paths of length 4.

[BibT_eX]

[DOI]

Jie Han

J. Graph Theory, 2021

High powers of Hamiltonian cycles in randomly augmented graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Variations on Twins in Permutations.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2020

Powers of Hamiltonian cycles in randomly augmented graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

On the Minimum Size of Hamilton Saturated Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

Monochromatic loose paths in multicolored k-uniform cliques.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2019

2018

On multicolor Ramsey numbers for loose k-paths of length three.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Constructive Ramsey Numbers for Loose Hyperpaths.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Ramsey properties of random graphs and Folkman numbers.

[BibT_eX]

[DOI]

Mathias Schacht

Discuss. Math. Graph Theory, 2017

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

[BibT_eX]

[DOI]

Discret. Math., 2017

Multicolor Ramsey Numbers and Restricted Turán Numbers for the Loose 3-Uniform Path of Length Three.

[BibT_eX]

[DOI]

Eliza Jackowska

Electron. J. Comb., 2017

An exponential-type upper bound for Folkman numbers.

[BibT_eX]

[DOI]

Mathias Schacht

Comb., 2017

2016

Upper Bounds on the Minimum Size of Hamilton Saturated Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

Turán Numbers for 3-Uniform Linear Paths of Length 3.

[BibT_eX]

[DOI]

Eliza Jackowska

Electron. J. Comb., 2016

2015

An improved upper bound on the density of universal random graphs.

[BibT_eX]

[DOI]

Domingos Dellamonica Jr.

Yoshiharu Kohayakawa

Random Struct. Algorithms, 2015

Loose Hamilton Cycles in Regular Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

2014

Approximate Counting of Matchings in (3,3)-Hypergraphs.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2014

Families of triples with high minimum degree are Hamiltonian.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2014

Approximate Counting of Matchings in (3, 3)-Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2014, 2014

2013

Approximate counting of regular hypergraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Hamilton Saturated Hypergraphs of Essentially Minimum Size.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

Approximate Counting of Matchings in Sparse Uniform Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, 2013

The Origins of the Theory of Random Graphs.

[BibT_eX]

[DOI]

Michal Karonski

Proceedings of the Mathematics of Paul Erdős I, 2013

2012

Universality of Random Graphs.

[BibT_eX]

[DOI]

Domingos Dellamonica Jr.

Yoshiharu Kohayakawa

SIAM J. Discret. Math., 2012

Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2012

On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size.

[BibT_eX]

[DOI]

Peter Frankl

Comb. Probab. Comput., 2012

Approximate Counting of Matchings in Sparse Hypergraphs

[BibT_eX]

[DOI]

CoRR, 2012

Rainbow Hamilton Cycles in Uniform Hypergraphs.

[BibT_eX]

[DOI]

Alan M. Frieze

Electron. J. Comb., 2012

2011

Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees.

[BibT_eX]

[DOI]

Klas Markström

Eur. J. Comb., 2011

2010

Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence.

[BibT_eX]

[DOI]

J. Comb. Optim., 2010

Computational Complexity of the Perfect Matching Problem in Hypergraphs with Subcritical Density.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2010

On the Number of Perfect Matchings in Random Lifts.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2010

Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Perfect matchings in large uniform hypergraphs with large minimum collective degree.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2009

Short paths in epsilon-regular pairs and small diameter decompositions of dense graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

The Complexity of Perfect Matching Problems on Dense Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Planar Ramsey numbers for cycles.

[BibT_eX]

[DOI]

Izolda Gorgol

Discret. Math., 2008

An approximate Dirac-type theorem for k -uniform hypergraphs.

[BibT_eX]

[DOI]

Comb., 2008

2007

Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Mathias Schacht

SIAM J. Discret. Math., 2007

2006

Short paths in quasi-random triple systems with sparse underlying graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

The Ramsey number for hypergraph cycles I.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

Perfect matchings in uniform hypergraphs with large minimum degree.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

A Dirac-Type Theorem for 3-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2006

Neighbour-Distinguishing Edge Colourings of Random Regular Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

A sharp threshold for random graphs with a monochromatic triangle in every edge coloring.

[BibT_eX]

Memoirs of the American Mathematical Society 845, American Mathematical Society, ISBN: 978-0-8218-3825-9, 2006

2005

Two variants of the size Ramsey number.

[BibT_eX]

[DOI]

Andrzej Kurek

Discuss. Math. Graph Theory, 2005

The Generalization of Dirac's Theorem for Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004

Random Hypergraph Processes with Degree Restrictions.

[BibT_eX]

[DOI]

Nicholas C. Wormald

Graphs Comb., 2004

The Deletion Method For Upper Tail Estimates.

[BibT_eX]

[DOI]

Comb., 2004

2003

Connectedness Of The Degree Bounded Star Process.

[BibT_eX]

[DOI]

Nicholas C. Wormald

Comb. Probab. Comput., 2003

Ramsey Games Against a One-Armed Bandit.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

2002

The infamous upper tail.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

Vertex Ramsey Properties of Families of Graphs.

[BibT_eX]

[DOI]

Sebastian Urbanski

J. Comb. Theory B, 2002

Ramsey Properties of Families of Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

Holes in Graphs.

[BibT_eX]

[DOI]

Yuejian Peng

Electron. J. Comb., 2002

2001

Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma.

[BibT_eX]

[DOI]

Michelle Wagner

SIAM J. Comput., 2001

On minimal Folkman graphs.

[BibT_eX]

[DOI]

Sebastian Urbanski

Discret. Math., 2001

On Bipartite Graphs with Linear Ramsey Numbers.

[BibT_eX]

[DOI]

Ronald L. Graham

Comb., 2001

Near-optimum Universal Graphs for Graphs with Bounded Degrees.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2001

2000

On graphs with linear Ramsey numbers.

[BibT_eX]

[DOI]

Ronald L. Graham

J. Graph Theory, 2000

Solitary subgraphs of random graphs.

[BibT_eX]

[DOI]

Justyna Kurkowiak

Discret. Math., 2000

Universality and Tolerance.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Random graphs.

[BibT_eX]

[DOI]

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

1999

Hypergraph Packing And Graph Embedding.

[BibT_eX]

[DOI]

Anusch Taraz

Comb. Probab. Comput., 1999

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

[BibT_eX]

[DOI]

Comb., 1999

1998

Ramsey Properties of Random Hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1998

Endomorphisms of Partially Ordered Sets.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1998

Perfect Matchings in ε-regular Graphs.

[BibT_eX]

[DOI]

Noga Alon

Electron. J. Comb., 1998

An Algorithmic Embedding of Graphs via Perfect Matchings.

[BibT_eX]

[DOI]

Michelle Wagner

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

1997

A note on local colorings of graphs.

[BibT_eX]

[DOI]

Miroslaw Truszczynski

Discret. Math., 1997

Bipartite Coverings of Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1997

1996

On the evolution of a random tournament.

[BibT_eX]

[DOI]

Jacek Gruszka

Discret. Math., 1996

1994

Random Graphs with Monochromatic Triangles in Every Edge Coloring.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1994

1993

The solution to an extremal problem on balanced extensions of graphs.

[BibT_eX]

[DOI]

Andrew Vince

J. Graph Theory, 1993

1992

Ramsey properties of random graphs.

[BibT_eX]

[DOI]

Bernd Voigt

J. Comb. Theory B, 1992

Matching and covering the vertices of a random graph by copies of a given graph.

[BibT_eX]

[DOI]

Discret. Math., 1992

Random Graph Processes with Degree Restrictions.

[BibT_eX]

[DOI]

Nicholas C. Wormald

Comb. Probab. Comput., 1992

1991

Tree-Matchings in Graph Processes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1991

1990

Small Cliques in Random Graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1990

1989

Random graphs.

[BibT_eX]

[DOI]

ZOR Methods Model. Oper. Res., 1989

A central limit theorem for decomposable random variables with applications to random graphs.

[BibT_eX]

[DOI]

Andrew D. Barbour

Michal Karonski

J. Comb. Theory B, 1989

1988

Balanced extensions of graphs and hypergraphs.

[BibT_eX]

[DOI]

Andrew Vince

Comb., 1988

1986

Strongly balanced graphs and random graphs.

[BibT_eX]

[DOI]

Andrew Vince

J. Graph Theory, 1986

On a method for random graphs.

[BibT_eX]

[DOI]

Zbigniew Palka

Joel Spencer

Discret. Math., 1986

On the order of the largest induced tree in a random graph.

[BibT_eX]

[DOI]

Zbigniew Palka

Discret. Appl. Math., 1986

1984

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

[BibT_eX]

[DOI]