Andrzej Ruciński

From MaRDI portal
Person:226978

Available identifiers

zbMath Open rucinski.andrzejDBLP01/3907-1WikidataQ24430148 ScholiaQ24430148MaRDI QIDQ226978

List of research outcomes





PublicationDate of PublicationType
Erdős-Szekeres type theorems for ordered uniform matchings2024-12-12Paper
Minimum pair-degee for tight Hamiltonian cycles in 4-uniform hypergraphs2024-10-18Paper
Subgraph games in the semi-random graph process and its generalization to hypergraphs2024-10-07Paper
Ordered unavoidable sub-structures in matchings and random matchings2024-05-10Paper
https://portal.mardi4nfdi.de/entity/Q60720632023-11-29Paper
Long twins in random words2023-11-15Paper
Sharper analysis of the random graph $d$-process via a balls-in-bins model2023-11-08Paper
Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection2023-11-06Paper
High powers of Hamiltonian cycles in randomly augmented graphs2023-10-04Paper
Twins in ordered hyper-matchings2023-10-02Paper
Patterns in ordered (random) matchings2023-07-26Paper
Sandwiching biregular random graphs2023-04-03Paper
Properly colored Hamilton cycles in Dirac-type hypergraphs2023-03-21Paper
Erd\H{o}s-Szekeres type Theorems for ordered uniform matchings2023-01-07Paper
Constructing sparsest \(\ell\)-Hamiltonian saturated \(k\)-uniform hypergraphs for a wide range of \(\ell\)2022-12-28Paper
On weak twins and up-and-down subpermutations2022-08-12Paper
Covering the edges of a random hypergraph by cliques2022-07-26Paper
https://portal.mardi4nfdi.de/entity/Q33904292022-03-24Paper
Tight multiple twins in permutations2021-12-18Paper
Variations on twins in permutations2021-08-06Paper
Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs2021-01-25Paper
On the minimum size of Hamilton saturated hypergraphs2020-12-03Paper
Ronald Louis Graham (1935 ‐ 2020)2020-11-30Paper
Properly colored Hamilton cycles in Dirac-type hypergraphs2020-06-30Paper
Powers of Hamiltonian cycles in randomly augmented graphs2020-06-19Paper
Constructive Ramsey numbers for loose hyperpaths2020-02-12Paper
Monochromatic loose paths in multicolored $k$-uniform cliques2020-01-13Paper
Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs2019-10-17Paper
Approximate Counting of Matchings in Sparse Uniform Hypergraphs2019-09-17Paper
A hierarchy of maximal intersecting triple systems2018-10-23Paper
On multicolor Ramsey numbers for loose \(k\)-paths of length three2018-05-18Paper
A short proof of Erdős' conjecture for triple systems2018-02-22Paper
An exponential-type upper bound for Folkman numbers2018-02-12Paper
Loose Hamilton Cycles in Regular Hypergraphs2017-10-04Paper
Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three2017-07-26Paper
Ramsey properties of random graphs and folkman numbers2017-07-17Paper
On the Hamiltonicity of triple systems with high minimum degree2017-04-12Paper
Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three2016-12-14Paper
Upper bounds on the minimum size of Hamilton saturated hypergraphs2016-12-06Paper
Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity2016-11-25Paper
Turán numbers for 3-uniform linear paths of length 32016-05-20Paper
An improved upper bound on the density of universal random graphs2015-04-09Paper
Approximate Counting of Matchings in (3,3)-Hypergraphs2014-09-02Paper
https://portal.mardi4nfdi.de/entity/Q54200102014-06-11Paper
Families of triples with high minimum degree are Hamiltonian2014-05-16Paper
Approximate counting of regular hypergraphs2014-04-14Paper
Hamilton saturated hypergraphs of essentially minimum size2013-06-07Paper
On the Number of Perfect Matchings in Random Lifts2013-03-13Paper
Universality of random graphs2012-08-22Paper
An Improved Upper Bound on the Density of Universal Random Graphs2012-06-29Paper
Rainbow Hamilton cycles in uniform hypergraphs2012-06-12Paper
Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels2012-06-04Paper
On the maximum number of edges in a triple system not containing a disjoint family of a given size2012-05-14Paper
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees2011-10-24Paper
Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs2011-06-14Paper
Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs2011-04-08Paper
https://portal.mardi4nfdi.de/entity/Q30782142011-02-18Paper
COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY2011-01-19Paper
https://portal.mardi4nfdi.de/entity/Q35794962010-08-06Paper
https://portal.mardi4nfdi.de/entity/Q35687122010-06-15Paper
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs2010-04-27Paper
Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence2010-04-26Paper
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles2010-04-23Paper
The Complexity of Perfect Matching Problems on Dense Hypergraphs2009-12-17Paper
Short paths in \(\varepsilon \)-regular pairs and small diameter decompositions of dense graphs2009-12-15Paper
Perfect matchings in large uniform hypergraphs with large minimum collective degree2009-06-17Paper
An approximate Dirac-type theorem for \(k\)-uniform hypergraphs2008-10-21Paper
Planar Ramsey numbers for cycles2008-09-04Paper
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs2008-05-22Paper
Perfect matchings in uniform hypergraphs with large minimum degree2006-11-15Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
Neighbour-distinguishing edge colourings of random regular graphs2006-08-30Paper
Short paths in quasi-random triple systems with sparse underlying graphs2006-07-12Paper
Planar Ramsey numbers for small graphs2006-03-30Paper
A sharp threshold for random graphs with a monochromatic triangle in every edge coloring2006-03-21Paper
The Ramsey number for hypergraph cycles. I.2006-03-16Paper
A Dirac-Type Theorem for 3-Uniform Hypergraphs2006-03-13Paper
The deletion method for upper tail estimates2005-10-04Paper
Two variants of the size Ramsey number2005-09-12Paper
Ramsey Games Against a One-Armed Bandit2005-03-08Paper
Random hypergraph processes with degree restrictions2005-01-20Paper
Upper tails for subgraph counts in random graphs2004-10-15Paper
https://portal.mardi4nfdi.de/entity/Q44711522004-06-18Paper
Ramsey properties of families of graphs2003-08-20Paper
Vertex Ramsey properties of families of graphs2002-12-10Paper
https://portal.mardi4nfdi.de/entity/Q47807922002-11-21Paper
Connectedness of graphs generated by a random d-process2002-11-17Paper
The infamous upper tail2002-07-01Paper
Matchings meeting quotas and their impact on the blow-up lemma2002-04-23Paper
On minimal Folkman graphs2002-03-20Paper
Random graph processes with maximum degree 22002-03-14Paper
On bipartite graphs with linear Ramsey numbers2002-02-13Paper
Holes in graphs2002-02-07Paper
On graphs with linear Ramsey numbers2001-07-23Paper
https://portal.mardi4nfdi.de/entity/Q45198962000-12-05Paper
Solitary subgraphs of random graphs2000-07-13Paper
Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma2000-02-21Paper
Hypergraph Packing and Graph Embedding2000-01-04Paper
https://portal.mardi4nfdi.de/entity/Q42471951999-12-13Paper
Endomorphisms of Partially Ordered Sets1998-08-20Paper
Ramsey properties of random hypergraphs1998-08-02Paper
Bipartite Coverings of Graphs1998-07-29Paper
Perfect matchings in \(\varepsilon\)-regular graphs1998-03-05Paper
On Schur properties of random subsets of integers1998-01-14Paper
https://portal.mardi4nfdi.de/entity/Q43574901997-09-25Paper
A note on local colorings of graphs1997-08-14Paper
Rado Partition Theorem for Random Subsets of Integers1997-07-07Paper
https://portal.mardi4nfdi.de/entity/Q27855641997-02-25Paper
https://portal.mardi4nfdi.de/entity/Q48656871996-06-18Paper
Threshold Functions for Ramsey Properties1996-05-29Paper
On the evolution of a random tournament1996-03-24Paper
https://portal.mardi4nfdi.de/entity/Q46974641995-07-16Paper
Random Graph Processes with Degree Restrictions1994-08-08Paper
https://portal.mardi4nfdi.de/entity/Q31397691994-06-22Paper
Globally sparse vertex‐ramsey graphs1994-06-22Paper
Random graphs with monochromatic triangles in every edge coloring1994-05-08Paper
https://portal.mardi4nfdi.de/entity/Q42846241994-03-24Paper
The solution to an extremal problem on balanced extensions of graphs1993-08-24Paper
https://portal.mardi4nfdi.de/entity/Q40271771993-02-21Paper
Matching and covering the vertices of a random graph by copies of a given graph1993-01-16Paper
Convex hulls of dense balanced graphs1992-10-26Paper
https://portal.mardi4nfdi.de/entity/Q40007951992-09-26Paper
https://portal.mardi4nfdi.de/entity/Q39750121992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39721361992-06-25Paper
Tree-Matchings in Graph Processes1992-06-25Paper
Ramsey properties of random graphs1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37856781990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33602231990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33496771990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32030521990-01-01Paper
Small cliques in random graphs1990-01-01Paper
A central limit theorem for decomposable random variables with applications to random graphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32030511989-01-01Paper
When are small subgraphs of a random graph normally distributed?1988-01-01Paper
Balanced extensions of graphs and hypergraphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38161131987-01-01Paper
On a method for random graphs1986-01-01Paper
Random graphs of binomial type with sparsely-edged initial graphs1986-01-01Paper
Poisson convergence and semi-induced properties of random graphs1986-01-01Paper
Strongly balanced graphs and random graphs1986-01-01Paper
On the order of the largest induced tree in a random graph1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37811371985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37151501985-01-01Paper
The behaviour of (n over \(k,\dots ,k,n-ik)c^ i/i!\) is asymptotically normal1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33330791983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39569931982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39367711981-01-01Paper
Subgraph Games in the Semi-Random Graph Process and Its Generalization to HypergraphsN/APaper
Largest bipartite sub-matchings of a random ordered matching or a problem with socksN/APaper

Research outcomes over time

This page was built for person: Andrzej Ruciński