3 papers
math.CO2020
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…
math.CO2020
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…
math.CO2020
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…