default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrzej Rucinski 0001
Person information
- affiliation: Adam Mickiewicz University, Poznan, Poland
- affiliation (former): University of Florida, Department of Statistics, Gainesville, USA
Other persons with the same name
- Andrzej Rucinski — disambiguation page
- Andrzej Rucinski 0002 — University of New Hampshire, Durham, NH, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j82]Andrzej Dudek
, Jaroslaw Grytczuk, Andrzej Rucinski:
Erdős-Szekeres type theorems for ordered uniform matchings. J. Comb. Theory B 170: 225-259 (2025)- 2024
- [j81]Andrzej Dudek, Jaroslaw Grytczuk, Andrzej Rucinski:
Ordered Unavoidable Sub-Structures in Matchings and Random Matchings. Electron. J. Comb. 31(2) (2024) - [j80]Natalie C. Behague, Trent G. Marbach, Pawel Pralat, Andrzej Rucinski:
Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs. Electron. J. Comb. 31(3) (2024) - 2023
- [j79]Sylwia Antoniuk, Nina Kamcev, Andrzej Rucinski:
Properly Colored Hamilton Cycles in Dirac-Type Hypergraphs. Electron. J. Comb. 30(1) (2023) - [j78]Tereza Klimosová, Christian Reiher, Andrzej Rucinski, Matas Sileikis:
Sandwiching biregular random graphs. Comb. Probab. Comput. 32(1): 1-44 (2023) - [j77]Andrzej Rucinski, Andrzej Zak:
Constructing sparsest ℓ-hamiltonian saturated k-uniform hypergraphs for a wide range of ℓ. Eur. J. Comb. 109: 103659 (2023) - [j76]Sylwia Antoniuk, Andrzej Dudek, Andrzej Rucinski:
Powers of Hamiltonian cycles in randomly augmented Dirac graphs - The complete collection. J. Graph Theory 104(4): 811-835 (2023) - 2022
- [j75]Vojtech Rödl, Andrzej Rucinski:
Covering the edges of a random hypergraph by cliques. Discuss. Math. Graph Theory 42(4): 1333-1349 (2022) - [c12]Andrzej Dudek, Jaroslaw Grytczuk, Andrzej Rucinski:
Patterns in Ordered (random) Matchings. LATIN 2022: 544-556 - 2021
- [j74]Andrzej Dudek, Jaroslaw Grytczuk, Andrzej Rucinski:
Variations on Twins in Permutations. Electron. J. Comb. 28(3): 3 (2021) - [j73]Sylwia Antoniuk, Andrzej Dudek, Christian Reiher, Andrzej Rucinski, Mathias Schacht:
High powers of Hamiltonian cycles in randomly augmented graphs. J. Graph Theory 98(2): 255-284 (2021) - [j72]Jie Han, Joanna Polcyn, Andrzej Rucinski:
Turán and Ramsey numbers for 3-uniform minimal paths of length 4. J. Graph Theory 98(3): 460-498 (2021) - 2020
- [j71]Andrzej Rucinski, Andrzej Zak:
On the Minimum Size of Hamilton Saturated Hypergraphs. Electron. J. Comb. 27(4): 4 (2020) - [j70]Andrzej Dudek, Christian Reiher, Andrzej Rucinski, Mathias Schacht:
Powers of Hamiltonian cycles in randomly augmented graphs. Random Struct. Algorithms 56(1): 122-141 (2020)
2010 – 2019
- 2019
- [j69]Andrzej Dudek, Andrzej Rucinski:
Monochromatic loose paths in multicolored k-uniform cliques. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - 2018
- [j68]Tomasz Luczak, Joanna Polcyn, Andrzej Rucinski:
On multicolor Ramsey numbers for loose k-paths of length three. Eur. J. Comb. 71: 43-50 (2018) - [c11]Andrzej Dudek, Andrzej Rucinski:
Constructive Ramsey Numbers for Loose Hyperpaths. LATIN 2018: 427-436 - 2017
- [j67]Vojtech Rödl, Andrzej Rucinski, Mathias Schacht:
An exponential-type upper bound for Folkman numbers. Comb. 37(4): 767-784 (2017) - [j66]Andrzej Rucinski, Eliza Jackowska, Joanna Polcyn:
Multicolor Ramsey Numbers and Restricted Turán Numbers for the Loose 3-Uniform Path of Length Three. Electron. J. Comb. 24(3): 3 (2017) - [j65]Joanna Polcyn, Andrzej Rucinski:
Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three. Discret. Math. 340(2): 107-118 (2017) - [j64]Vojtech Rödl, Andrzej Rucinski, Mathias Schacht:
Ramsey properties of random graphs and Folkman numbers. Discuss. Math. Graph Theory 37(3): 755-776 (2017) - [j63]Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski, Matas Sileikis:
Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity. J. Comb. Theory B 122: 719-740 (2017) - 2016
- [j62]Eliza Jackowska, Joanna Polcyn, Andrzej Rucinski:
Turán Numbers for 3-Uniform Linear Paths of Length 3. Electron. J. Comb. 23(2): 2 (2016) - [j61]Andrzej Rucinski, Andrzej Zak:
Upper Bounds on the Minimum Size of Hamilton Saturated Hypergraphs. Electron. J. Comb. 23(4): 4 (2016) - 2015
- [j60]Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski, Matas Sileikis:
Loose Hamilton Cycles in Regular Hypergraphs. Comb. Probab. Comput. 24(1): 179-194 (2015) - [j59]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
An improved upper bound on the density of universal random graphs. Random Struct. Algorithms 46(2): 274-299 (2015) - 2014
- [j58]Vojtech Rödl, Andrzej Rucinski:
Families of triples with high minimum degree are Hamiltonian. Discuss. Math. Graph Theory 34(2): 361-381 (2014) - [c10]Andrzej Dudek, Marek Karpinski, Andrzej Rucinski, Edyta Szymanska:
Approximate Counting of Matchings in (3, 3)-Hypergraphs. SWAT 2014: 380-391 - [i4]Andrzej Dudek, Marek Karpinski, Andrzej Rucinski, Edyta Szymanska:
Approximate Counting of Matchings in (3, 3)-Hypergraphs. CoRR abs/1402.6190 (2014) - [i3]Andrzej Dudek, Marek Karpinski, Andrzej Rucinski, Edyta Szymanska:
Approximate Counting of Matchings in (3,3)-Hypergraphs. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j57]Andrzej Rucinski, Andrzej Zak:
Hamilton Saturated Hypergraphs of Essentially Minimum Size. Electron. J. Comb. 20(2): 25 (2013) - [j56]Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski, Matas Sileikis:
Approximate counting of regular hypergraphs. Inf. Process. Lett. 113(19-21): 785-788 (2013) - [c9]Edyta Szymanska, Marek Karpinski, Andrzej Rucinski:
Approximate Counting of Matchings in Sparse Uniform Hypergraphs. ANALCO 2013: 72-79 - [p1]Michal Karonski, Andrzej Rucinski:
The Origins of the Theory of Random Graphs. The Mathematics of Paul Erdős I 2013: 371-397 - 2012
- [j55]Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski:
Rainbow Hamilton Cycles in Uniform Hypergraphs. Electron. J. Comb. 19(1): 46 (2012) - [j54]Peter Frankl, Vojtech Rödl, Andrzej Rucinski:
On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size. Comb. Probab. Comput. 21(1-2): 141-148 (2012) - [j53]Noga Alon, Peter Frankl, Hao Huang, Vojtech Rödl, Andrzej Rucinski, Benny Sudakov:
Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels. J. Comb. Theory A 119(6): 1200-1215 (2012) - [j52]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
Universality of Random Graphs. SIAM J. Discret. Math. 26(1): 353-374 (2012) - [c8]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
An Improved Upper Bound on the Density of Universal Random Graphs. LATIN 2012: 231-242 - [i2]Marek Karpinski, Andrzej Rucinski, Edyta Szymanska:
Approximate Counting of Matchings in Sparse Hypergraphs. CoRR abs/1202.5885 (2012) - [i1]Marek Karpinski, Andrzej Rucinski, Edyta Szymanska:
Approximate Counting of Matchings in Sparse Uniform Hypergraphs. CoRR abs/1204.5335 (2012) - 2011
- [j51]Klas Markström, Andrzej Rucinski:
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees. Eur. J. Comb. 32(5): 677-687 (2011) - 2010
- [j50]Catherine S. Greenhill, Svante Janson, Andrzej Rucinski:
On the Number of Perfect Matchings in Random Lifts. Comb. Probab. Comput. 19(5-6): 791-817 (2010) - [j49]Marek Karpinski, Andrzej Rucinski, Edyta Szymanska:
Computational Complexity of the Perfect Matching Problem in Hypergraphs with Subcritical Density. Int. J. Found. Comput. Sci. 21(6): 905-924 (2010) - [j48]Andrzej Dudek, Joanna Polcyn, Andrzej Rucinski:
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence. J. Comb. Optim. 19(2): 184-199 (2010) - [c7]Marek Karpinski, Andrzej Rucinski, Edyta Szymanska:
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs. LATIN 2010: 662-673
2000 – 2009
- 2009
- [j47]Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Jozef Skokan:
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. Comb. Probab. Comput. 18(1-2): 165-203 (2009) - [j46]Joanna Polcyn, Andrzej Rucinski:
Short paths in epsilon-regular pairs and small diameter decompositions of dense graphs. Discret. Math. 309(22): 6375-6381 (2009) - [j45]Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Perfect matchings in large uniform hypergraphs with large minimum collective degree. J. Comb. Theory A 116(3): 613-636 (2009) - [c6]Marek Karpinski, Andrzej Rucinski, Edyta Szymanska:
The Complexity of Perfect Matching Problems on Dense Hypergraphs. ISAAC 2009: 626-636 - 2008
- [j44]Vojtech Rödl, Endre Szemerédi, Andrzej Rucinski:
An approximate Dirac-type theorem for k -uniform hypergraphs. Comb. 28(2): 229-260 (2008) - [j43]Izolda Gorgol, Andrzej Rucinski:
Planar Ramsey numbers for cycles. Discret. Math. 308(19): 4389-4395 (2008) - [c5]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
Universality of random graphs. SODA 2008: 782-788 - 2007
- [j42]Vojtech Rödl, Andrzej Rucinski, Mathias Schacht:
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs. SIAM J. Discret. Math. 21(2): 442-460 (2007) - 2006
- [b2]Ehud Friedgut, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali:
A sharp threshold for random graphs with a monochromatic triangle in every edge coloring. Memoirs of the American Mathematical Society 845, American Mathematical Society 2006, ISBN 978-0-8218-3825-9, pp. 1-66 - [j41]Catherine S. Greenhill, Andrzej Rucinski:
Neighbour-Distinguishing Edge Colourings of Random Regular Graphs. Electron. J. Comb. 13(1) (2006) - [j40]Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
A Dirac-Type Theorem for 3-Uniform Hypergraphs. Comb. Probab. Comput. 15(1-2): 229-251 (2006) - [j39]Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Perfect matchings in uniform hypergraphs with large minimum degree. Eur. J. Comb. 27(8): 1333-1349 (2006) - [j38]Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Short paths in quasi-random triple systems with sparse underlying graphs. J. Comb. Theory B 96(4): 584-607 (2006) - [j37]Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan:
The Ramsey number for hypergraph cycles I. J. Comb. Theory A 113(1): 67-83 (2006) - 2005
- [j36]Andrzej Kurek, Andrzej Rucinski:
Two variants of the size Ramsey number. Discuss. Math. Graph Theory 25(1-2): 141-149 (2005) - [c4]Endre Szemerédi, Andrzej Rucinski, Vojtech Rödl:
The Generalization of Dirac's Theorem for Hypergraphs. MFCS 2005: 52-56 - 2004
- [j35]Svante Janson, Andrzej Rucinski:
The Deletion Method For Upper Tail Estimates. Comb. 24(4): 615-640 (2004) - [j34]Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald:
Random Hypergraph Processes with Degree Restrictions. Graphs Comb. 20(3): 319-332 (2004) - 2003
- [j33]Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald:
Connectedness Of The Degree Bounded Star Process. Comb. Probab. Comput. 12(3): 269-283 (2003) - [j32]Ehud Friedgut, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali:
Ramsey Games Against a One-Armed Bandit. Comb. Probab. Comput. 12(5-6): 515-545 (2003) - 2002
- [j31]Yuejian Peng, Vojtech Rödl, Andrzej Rucinski:
Holes in Graphs. Electron. J. Comb. 9(1) (2002) - [j30]Tomasz Luczak, Andrzej Rucinski, Sebastian Urbanski:
Vertex Ramsey Properties of Families of Graphs. J. Comb. Theory B 84(2): 240-248 (2002) - [j29]Ronald L. Graham, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski:
Ramsey Properties of Families of Graphs. J. Comb. Theory B 86(2): 413-419 (2002) - [j28]Svante Janson, Andrzej Rucinski:
The infamous upper tail. Random Struct. Algorithms 20(3): 317-342 (2002) - 2001
- [j27]Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski:
On Bipartite Graphs with Linear Ramsey Numbers. Comb. 21(2): 199-209 (2001) - [j26]Tomasz Luczak, Andrzej Rucinski, Sebastian Urbanski:
On minimal Folkman graphs. Discret. Math. 236(1-3): 245-262 (2001) - [j25]Vojtech Rödl, Andrzej Rucinski, Michelle Wagner:
Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma. SIAM J. Comput. 31(2): 428-446 (2001) - [c3]Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Near-optimum Universal Graphs for Graphs with Bounded Degrees. RANDOM-APPROX 2001: 170-180 - 2000
- [b1]Svante Janson, Tomasz Luczak, Andrzej Rucinski:
Random graphs. Wiley-Interscience series in discrete mathematics and optimization, Wiley 2000, ISBN 978-0-471-17541-4, pp. I-XI, 1-333 - [j24]Justyna Kurkowiak, Andrzej Rucinski:
Solitary subgraphs of random graphs. Discret. Math. 213(1-3): 195-209 (2000) - [j23]Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski:
On graphs with linear Ramsey numbers. J. Graph Theory 35(3): 176-192 (2000) - [c2]Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Universality and Tolerance. FOCS 2000: 14-21
1990 – 1999
- 1999
- [j22]Vojtech Rödl, Andrzej Rucinski:
Perfect Matchings in <epsilon>-Regular Graphs and the Blow-Up Lemma. Comb. 19(3): 437-452 (1999) - [j21]Vojtech Rödl, Andrzej Rucinski, Anusch Taraz:
Hypergraph Packing And Graph Embedding. Comb. Probab. Comput. 8(4): 363-376 (1999) - 1998
- [j20]Noga Alon, Vojtech Rödl, Andrzej Rucinski:
Perfect Matchings in ε-regular Graphs. Electron. J. Comb. 5 (1998) - [j19]Dwight Duffus, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski:
Endomorphisms of Partially Ordered Sets. Comb. Probab. Comput. 7(1): 33-46 (1998) - [j18]Vojtech Rödl, Andrzej Rucinski:
Ramsey Properties of Random Hypergraphs. J. Comb. Theory A 81(1): 1-33 (1998) - [c1]Vojtech Rödl, Andrzej Rucinski, Michelle Wagner:
An Algorithmic Embedding of Graphs via Perfect Matchings. RANDOM 1998: 25-34 - 1997
- [j17]Vojtech Rödl, Andrzej Rucinski:
Bipartite Coverings of Graphs. Comb. Probab. Comput. 6(3): 349-352 (1997) - [j16]Andrzej Rucinski, Miroslaw Truszczynski:
A note on local colorings of graphs. Discret. Math. 164(1-3): 251-255 (1997) - 1996
- [j15]Tomasz Luczak, Andrzej Rucinski, Jacek Gruszka:
On the evolution of a random tournament. Discret. Math. 148(1-3): 311-316 (1996) - 1994
- [j14]Vojtech Rödl, Andrzej Rucinski:
Random Graphs with Monochromatic Triangles in Every Edge Coloring. Random Struct. Algorithms 5(2): 253-270 (1994) - 1993
- [j13]Andrzej Rucinski, Andrew Vince:
The solution to an extremal problem on balanced extensions of graphs. J. Graph Theory 17(3): 417-431 (1993) - 1992
- [j12]Andrzej Rucinski, Nicholas C. Wormald:
Random Graph Processes with Degree Restrictions. Comb. Probab. Comput. 1: 169-180 (1992) - [j11]Andrzej Rucinski:
Matching and covering the vertices of a random graph by copies of a given graph. Discret. Math. 105(1-3): 185-197 (1992) - [j10]Tomasz Luczak, Andrzej Rucinski, Bernd Voigt:
Ramsey properties of random graphs. J. Comb. Theory B 56(1): 55-68 (1992) - 1991
- [j9]Tomasz Luczak, Andrzej Rucinski:
Tree-Matchings in Graph Processes. SIAM J. Discret. Math. 4(1): 107-120 (1991) - 1990
- [j8]Andrew D. Barbour, Svante Janson, Michal Karonski, Andrzej Rucinski:
Small Cliques in Random Graphs. Random Struct. Algorithms 1(4): 403-434 (1990)
1980 – 1989
- 1989
- [j7]Andrew D. Barbour, Michal Karonski, Andrzej Rucinski:
A central limit theorem for decomposable random variables with applications to random graphs. J. Comb. Theory B 47(2): 125-145 (1989) - [j6]Andrzej Rucinski:
Random graphs. ZOR Methods Model. Oper. Res. 33(2): 145 (1989) - 1988
- [j5]Andrzej Rucinski, Andrew Vince:
Balanced extensions of graphs and hypergraphs. Comb. 8(3): 279-291 (1988) - 1986
- [j4]Zbigniew Palka, Andrzej Rucinski:
On the order of the largest induced tree in a random graph. Discret. Appl. Math. 15(1): 75-83 (1986) - [j3]Zbigniew Palka, Andrzej Rucinski, Joel Spencer:
On a method for random graphs. Discret. Math. 61(2-3): 253-258 (1986) - [j2]Andrzej Rucinski, Andrew Vince:
Strongly balanced graphs and random graphs. J. Graph Theory 10(2): 251-264 (1986) - 1984
- [j1]Andrzej Rucinski:
The behaviour of (k, ..., kn, n-ik)ci/i! is asymptotically normal. Discret. Math. 49(3): 287-290 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
