24 citations · 24 across the 6 of their papers we have counts for
7 papers
Homogeneous substructures in random ordered uniform matchings
Andrzej Dudek, Jarosław Grytczuk, Jakub Przybyło +1
An ordered -uniform matching of size is a collection of pairwise disjoint -subsets of a linearly ordered set of vertices. For , such a matching is called an…
Powers of Hamiltonian cycles in randomly augmented Pósa-Seymour graphs
Sylwia Antoniuk, Andrzej Dudek, Andrzej Ruciński
We study the question of the least number of random edges that need to be added to a Pósa-Seymour graph, that is, a graph with minimum degree exceeding , to secure t…
Homogeneous substructures in random ordered hyper-matchings
Andrzej Dudek, Jarosław Grytczuk, Jakub Przybyło +1
An ordered -uniform matching of size is a collection of pairwise disjoint -subsets of a linearly ordered set of vertices. For , such a matching is called an…
Loose paths in random ordered hypergraphs
Andrzej Dudek, Alan Frieze, Wesley Pegden
We consider the length of {\em ordered loose paths} in the random -uniform hypergraph . A ordered loose path is a sequence of edges wher…
Largest bipartite sub-matchings of a random ordered matching or a problem with socks
Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński
Let be an ordered matching of size , that is, a partition of the set into 2-element subsets. The sock number of is the maximum size of a sub-matching of in wh…
Twins in ordered hyper-matchings
Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński
An ordered -matching of size is an -uniform hypergraph on a linearly ordered set of vertices, consisting of pairwise disjoint edges. Two ordered -matchings are iso…
Powers of Hamiltonian cycles in randomly augmented graphs
Andrzej Dudek, Christian Reiher, Andrzej Ruciński +1
We study 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. It follows from the th…