3 citations · 6 across the 4 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2023★ 2 cited
Erdős-Szekeres type Theorems for ordered uniform matchings
Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński
For , an ordered -uniform matching of size is an -uniform hypergraph on a linearly ordered vertex set , with , consisting of pairwise disjoint edg…
math.CO2022★ 1 cited
Ordered unavoidable sub-structures in matchings and random matchings
Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński
An ordered matching of size is a graph on a linearly ordered vertex set , , consisting of pairwise disjoint edges. There are three different ordered matchings of…
math.CO2022
Powers of Hamiltonian cycles in randomly augmented Dirac graphs -- the complete collection
Sylwia Antoniuk, Andrzej Dudek, Andrzej Ruciński
We study the powers of Hamiltonian cycles in randomly augmented Dirac graphs, that is, -vertex graphs with minimum degree at least to which some random…