27 citations · 95 across the 19 of their papers we have counts for
22 papers
Multiple twins in permutations
Andrzej Dudek, Jaroslaw Grytczuk, Andrzej Rucinski
By an -tuplet in a permutation we mean a family of pairwise disjoint subsequences with the same relative order. The length of an -tuplet is defined as the length of any s…
Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs
Natalie C. Behague, Trent G. Marbach, Pawel Pralat +1
The semi-random graph process is a single-player game that begins with an empty graph on vertices. In each round, a vertex is presented to the player independently and unif…
Minimum pair degree condition for tight Hamiltonian cycles in -uniform hypergraphs
Joanna Polcyn, Christian Reiher, Vojtěch Rödl +3
We show that every 4-uniform hypergraph with vertices and minimum pair degree at least contains a tight Hamiltonian cycle. This degree condition is asymptotic…
Monochromatic loose paths in multicolored -uniform cliques
Andrzej Dudek, Andrzej Ruciński
For integers and , a -uniform hypergraph is called a loose path of length , and denoted by , if it consists of edges $e_1,\dots,e…
On multicolor Ramsey numbers for loose -paths of length three
Tomasz Łuczak, Joanna Polcyn, Andrzej Ruciński
We show that there exists an absolute constant such that for each and every coloring of the edges of the complete -uniform hypergraph on vertices with colo…
A hierarchy of maximal intersecting triple systems
Joanna Polcyn, Andrzej Rucinski
We reach beyond the celebrated theorems of Erdős-Ko-Rado and Hilton-Milner, and, a recent theorem of Han-Kohayakawa, and determine all maximal intersecting triples systems. It turn…