44 citations · 113 across the 33 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…
Closing the Random Graph Gap in Tuza's Conjecture Through the Online Triangle Packing Process
Patrick Bennett, Ryan Cushman, Andrzej Dudek
A long-standing conjecture of Zsolt Tuza asserts that the triangle covering number is at most twice the triangle packing number , where the triangle packing number $ν(…
A gentle introduction to the differential equation method and dynamic concentration
Patrick Bennett, Andrzej Dudek
We discuss the differential equation method for establishing dynamic concentration of discrete random processes. We present several relatively simple examples of it and aim to make…
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…
On the number of alternating paths in random graphs
Patrick Bennett, Ryan Cushman, Andrzej Dudek
In the noisy channel model from coding theory, we wish to detect errors introduced during transmission by optimizing various parameters of the code. Bennett, Dudek, and LaForge fra…
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…