2 citations · 6 across the 5 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021
Every Steiner triple system contains an almost spanning d-ary hypertree
Andrii Arman, Vojtěch Rödl, Marcelo Tadeu Sales
In this paper we make a partial progress on the following conjecture: for every and large enough , every Steiner triple system on at least vertices contains e…
math.CO2021
Linear-time uniform generation of random sparse contingency tables with specified marginals
Andrii Arman, Pu Gao, Nicholas Wormald
We give an algorithm that generates a uniformly random contingency table with specified marginals, i.e. a matrix with non-negative integer values and specified row and column sums.…
math.CO2021
Colourful matchings
Andrii Arman, Vojtěch Rödl, Marcelo Tadeu Sales
Suppose a committee consisting of three members has to match candidates to different positions. Each member of the committee proposes a matching, however the proposed match…