Andrzej Rucinski
Affiliations: | Emory University, Atlanta, GA |
Area:
MathematicsGoogle:
"Andrzej Rucinski"
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Polcyn J, Reiher C, Rödl V, et al. (2020) Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs Acta Mathematica Hungarica. 161: 647-699 |
| Dudek A, Reiher C, Ruciński A, et al. (2020) Powers of Hamiltonian cycles in randomly augmented graphs Random Structures and Algorithms. 56: 122-141 |
| Reiher C, Rödl V, Ruciński A, et al. (2019) Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs Proceedings of the London Mathematical Society. 119: 409-439 |
| Łuczak T, Polcyn J, Ruciński A. (2018) On multicolor Ramsey numbers for loose k-paths of length three European Journal of Combinatorics. 71: 43-50 |
| Polcyn J, Ruciński A. (2017) A hierarchy of maximal intersecting triple systems Opuscula Mathematica. 37: 597-608 |
| Rödl V, Ruciński A, Schacht M. (2017) Ramsey properties of random graphs and Folkman numbers Discussiones Mathematicae Graph Theory. 37: 755 |
| Ruciński A, Jackowska E, Polcyn J. (2017) Multicolor Ramsey Numbers and Restricted Turán Numbers for the Loose 3-Uniform Path of Length Three Electronic Journal of Combinatorics. 24: 3-5 |
| Dudek A, Frieze AM, Rucinski A, et al. (2017) Embedding the Erdős–Rényi hypergraph into the random regular hypergraph and Hamiltonicity Journal of Combinatorial Theory, Series B. 122: 719-740 |
| Polcyn J, Ruciński A. (2017) Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three Discrete Mathematics. 340: 107-118 |
| Frankl P, Rödl V, Ruciński A. (2017) A short proof of Erdős’ conjecture for triple systems Acta Mathematica Hungarica. 151: 495-509 |