Andrzej Ruci'nski

activity

20242026

collaborators

5 papers

math.CO2026

Homogeneous substructures in random ordered hyper-matchings

Andrzej Dudek, JarosÅaw Grytczuk, Jakub PrzybyÅo +1

An ordered $r$ -uniform matching of size $n$ is a collection of $n$ pairwise disjoint $r$ -subsets of a linearly ordered set of $r n$ vertices. For $n = 2$ , such a matching is called an…

math.CO2026

Homogeneous substructures in random ordered uniform matchings

Andrzej Dudek, JarosÅaw Grytczuk, Jakub PrzybyÅo +1

An ordered $r$ -uniform matching of size $n$ is a collection of $n$ pairwise disjoint $r$ -subsets of a linearly ordered set of $r n$ vertices. For $n = 2$ , such a matching is called an…

math.CO2025

Powers of Hamiltonian cycles in randomly augmented PÃ³sa-Seymour graphs

Sylwia Antoniuk, Andrzej Dudek, Andrzej RuciÅski

We study the question of the least number of random edges that need to be added to a PÃ³sa-Seymour graph, that is, a graph with minimum degree exceeding $\frac{k}{k + 1} n$ , to secure…

math.CO2025

Shuffle squares and ordered nest-free graphs

JarosÅaw Grytczuk, BartÅomiej Pawlik, Andrzej RuciÅski

A shuffle square is a word consisting of two shuffled copies of the same word. For instance, the Turkish word $\mathtt{\color{red}{ik}\color{blue}{i}\color{red}{li}\color{blue}{kli…

math.CO2024

Largest bipartite sub-matchings of a random ordered matching or a problem with socks

Andrzej Dudek, JarosÅaw Grytczuk, Andrzej RuciÅski

Let $M$ be an ordered matching of size $n$ , that is, a partition of the set $[2 n]$ into 2-element subsets. The sock number of $M$ is the maximum size of a sub-matching of $M$ in wh…