42 citations · 42 across the 9 of their papers we have counts for
6 papers · 1 filter
On weak twins and up-and-down sub-permutations
Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński
Two permutations and are weakly similar if if and only if for all . Let be a permutati…
Sandwiching biregular random graphs
Tereza Klimošová, Christian Reiher, Andrzej Ruciński +1
Let be a uniformly random -edge subgraph of the complete bipartite graph with bipartition , where . Given a real number $p \in [0,1…
Turán and Ramsey numbers for -uniform minimal paths of length
Jie Han, Joanna Polcyn, Andrzej Ruciński
We determine Turán numbers for the family of 3-uniform minimal paths of length four \emph{for all }. We also establish the second and third order Turán numbers and use them to c…
Properly colored Hamilton cycles in Dirac-type hypergraphs
Sylwia Antoniuk, Nina Kamčev, Andrzej Ruciński
We consider a robust variant of Dirac-type problems in -uniform hypergraphs. For instance, we prove that if is a -uniform hypergraph with minimum codegree at least $(1/2…
High powers of Hamiltonian cycles in randomly augmented graphs
Sylwia Antoniuk, Andrzej Dudek, Christian Reiher +2
We investigate the existence of powers of Hamiltonian cycles in graphs with large minimum degree to which some additional edges have been added in a random manner. For all integers…
Variations on twins in permutations
Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński
Let be a permutation of the set . Two disjoint order-isomorphic subsequences of are called twins. How long twins are contained in every permutation? T…