Andrzej Rucinski

activity

20162026

most citedMinimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs

42 citations · 42 across the 9 of their papers we have counts for

collaborators

12 papers

math.CO2026

Rainbow Turán numbers for paths of length four

Sylwia Antoniuk, Andrzej Grzesik, Magdalena Prorok +1

Given a set $V$ of $n$ vertices and an integer $k \geq 1$ , our goal is to maximize the number of edges in graphs $G_{1}, G_{2}, \dots, G_{k}$ , defined on $V$ , under the constraint that the…

math.CO2021

Long twins in random words

Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński

Twins in a finite word are formed by a pair of identical subwords placed at disjoint sets of positions. We investigate the maximum length of twins in a random word over a $k$ -lette…

math.CO2021

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

Andrzej Ruciński, Andrzej Żak

Given $k \geq 3$ and $1 \leq ℓ < k$ , an $(ℓ, k)$ -cycle is one in which consecutive edges, each of size $k$ , overlap in exactly $ℓ$ vertices. We study the smallest number of edge…

math.CO2021

Tight multiple twins in permutations

Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński

Two permutations are similar if they have the same length and the same relative order. A collection of $r \geq 2$ disjoint, similar subsequences of a permutation $π$ form $r$ -twins in…

math.CO2020

On weak twins and up-and-down sub-permutations

Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński

Two permutations $(x_{1}, \dots, x_{w})$ and $(y_{1}, \dots, y_{w})$ are weakly similar if $x_{i} < x_{i + 1}$ if and only if $y_{i} < y_{i + 1}$ for all $1 ⩽ i ⩽ w$ . Let $π$ be a permutati…

math.CO2020

Sandwiching biregular random graphs

Tereza Klimošová, Christian Reiher, Andrzej Ruciński +1

Let $G (n, n, m)$ be a uniformly random $m$ -edge subgraph of the complete bipartite graph $K_{n, n}$ with bipartition $(V_{1}, V_{2})$ , where $n_{i} = ∣ V_{i} ∣$ . Given a real number $p \in [0,1…

Rainbow Turán numbers for paths of length four

Long twins in random words

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

Tight multiple twins in permutations

On weak twins and up-and-down sub-permutations

Sandwiching biregular random graphs

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